Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100152.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-19, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 1717385701207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-03 03:35:03] [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-06-03 03:35:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 03:35:04] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-06-03 03:35:04] [INFO ] Transformed 272 places.
[2024-06-03 03:35:04] [INFO ] Transformed 586 transitions.
[2024-06-03 03:35:04] [INFO ] Found NUPN structural information;
[2024-06-03 03:35:04] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 709 ms.
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 3 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 269/269 places, 583/583 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
[2024-06-03 03:35:04] [INFO ] Redundant transitions in 56 ms returned []
Running 576 sub problems to find dead transitions.
// Phase 1: matrix 577 rows 269 cols
[2024-06-03 03:35:04] [INFO ] Computed 24 invariants in 37 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/269 variables, 10/290 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 3/293 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:35:23] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 29 ms to minimize.
[2024-06-03 03:35:23] [INFO ] Deduced a trap composed of 50 places in 365 ms of which 4 ms to minimize.
[2024-06-03 03:35:24] [INFO ] Deduced a trap composed of 63 places in 313 ms of which 5 ms to minimize.
[2024-06-03 03:35:24] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 5 ms to minimize.
[2024-06-03 03:35:24] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 3 ms to minimize.
[2024-06-03 03:35:25] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 3 ms to minimize.
[2024-06-03 03:35:25] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 2 ms to minimize.
[2024-06-03 03:35:25] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-03 03:35:25] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:35:26] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-03 03:35:26] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-03 03:35:26] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-06-03 03:35:26] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 5 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 3 ms to minimize.
[2024-06-03 03:35:27] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:35:28] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 20/313 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:35:28] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-06-03 03:35:28] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2024-06-03 03:35:29] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-06-03 03:35:29] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 7 ms to minimize.
[2024-06-03 03:35:30] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 6 ms to minimize.
[2024-06-03 03:35:30] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 4 ms to minimize.
[2024-06-03 03:35:30] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-06-03 03:35:30] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-06-03 03:35:31] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-03 03:35:31] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 3 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:35:32] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-06-03 03:35:33] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:35:33] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-06-03 03:35:33] [INFO ] Deduced a trap composed of 34 places in 141 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 1.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 1.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 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.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 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.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 1.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 1.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 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.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 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)timeout

(s241 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 20/333 constraints. Problems are: Problem set: 120 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/846 variables, and 333 constraints, problems are : Problem set: 120 solved, 456 unsolved in 30056 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/269 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 120 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 14/280 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 3 (OVERLAPS) 3/269 variables, 10/290 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 3/293 constraints. Problems are: Problem set: 120 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 40/333 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:35:44] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-03 03:35:44] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-06-03 03:35:44] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:35:45] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 3 ms to minimize.
[2024-06-03 03:35:45] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 4 ms to minimize.
[2024-06-03 03:35:46] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-06-03 03:35:46] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-06-03 03:35:47] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-06-03 03:35:47] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-03 03:35:47] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-06-03 03:35:48] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 4 ms to minimize.
[2024-06-03 03:35:48] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-06-03 03:35:48] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 9 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-06-03 03:35:49] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-06-03 03:35:50] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 20/353 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:35:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:35:53] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-06-03 03:35:53] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-03 03:35:53] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 3 ms to minimize.
[2024-06-03 03:35:53] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-06-03 03:35:54] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 6/359 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:35:57] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 3 ms to minimize.
[2024-06-03 03:35:58] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/361 constraints. Problems are: Problem set: 120 solved, 456 unsolved
[2024-06-03 03:36:05] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/846 variables, and 362 constraints, problems are : Problem set: 120 solved, 456 unsolved in 30021 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/269 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 69/69 constraints]
After SMT, in 62470ms problems are : Problem set: 120 solved, 456 unsolved
Search for dead transitions found 120 dead transitions in 62552ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 269/269 places, 457/583 transitions.
[2024-06-03 03:36:07] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 63020 ms. Remains : 269/269 places, 457/583 transitions.
Final net has 269 places and 457 transitions.
[2024-06-03 03:36:07] [INFO ] Flatten gal took : 126 ms
[2024-06-03 03:36:07] [INFO ] Applying decomposition
[2024-06-03 03:36:07] [INFO ] Flatten gal took : 48 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/graph4799443674824784140.txt' '-o' '/tmp/graph4799443674824784140.bin' '-w' '/tmp/graph4799443674824784140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4799443674824784140.bin' '-l' '-1' '-v' '-w' '/tmp/graph4799443674824784140.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:36:08] [INFO ] Decomposing Gal with order
[2024-06-03 03:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:36:08] [INFO ] Removed a total of 782 redundant transitions.
[2024-06-03 03:36:08] [INFO ] Flatten gal took : 142 ms
[2024-06-03 03:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 21 ms.
[2024-06-03 03:36:08] [INFO ] Time to serialize gal into /tmp/StateSpace16913352733354130970.gal : 15 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/StateSpace16913352733354130970.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
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.22116e+13,4.46188,102084,4179,498,145111,18839,790,468252,178,169707,0
Total reachable state count : 22211581521061

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 16
STATE_SPACE MAX_TOKEN_PER_MARKING 16 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 22211581521061
STATE_SPACE STATES 22211581521061 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 69510 ms.

BK_STOP 1717385773085

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r576-smll-171734920100152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 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 ;