fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r368-tall-178024404800125
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for SupplyChain-PT-00050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
680.012 14345.00 38882.00 120.80 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r368-tall-178024404800125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is SupplyChain-PT-00050, examination is OneSafe
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r368-tall-178024404800125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.2K May 27 07:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 07:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 27 07:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 07:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 27 07:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 27 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 27 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 202K May 26 18:17 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 OneSafe

=== Now, execution of the tool begins

BK_START 1780307453107

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=OneSafe
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SupplyChain-PT-00050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
OneSafe PT
Running Version 202505121319
[2026-06-01 09:50:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, OneSafe, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-01 09:50:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 09:50:54] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-06-01 09:50:54] [INFO ] Transformed 654 places.
[2026-06-01 09:50:54] [INFO ] Transformed 403 transitions.
[2026-06-01 09:50:54] [INFO ] Parsed PT model containing 654 places and 403 transitions and 1806 arcs in 182 ms.
Structural unfed/single firing approximation deduced that 252/654 places are one safe.
// Phase 1: matrix 403 rows 654 cols
[2026-06-01 09:50:54] [INFO ] Computed 352 invariants in 37 ms
[2026-06-01 09:50:54] [INFO ] Rough structural analysis with invariants proved 152 places are one safe in 49 ms (including invariant computation).
Starting Z3 with timeout 100.0 s and query timeout 10000.0 ms
[2026-06-01 09:50:55] [INFO ] [Real]Absence check using 102 positive place invariants in 199 ms proved 0 places are One-Safe.
[2026-06-01 09:50:55] [INFO ] [Real]Absence check using 102 positive and 250 generalized place invariants in 165 ms proved 0 places are One-Safe.
[2026-06-01 09:50:55] [INFO ] [Real] State equation constraints in 339 ms proved 501 places are One-Safe.
[2026-06-01 09:50:56] [INFO ] Flatten gal took : 182 ms
[2026-06-01 09:50:56] [INFO ] Flatten gal took : 54 ms
[2026-06-01 09:50:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12559857948859602910.gal : 43 ms
[2026-06-01 09:50:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17393996936392986478.prop : 3 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12559857948859602910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17393996936392986478.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17393996936392986478.prop.
RANDOM walk for 40000 steps (156 resets) in 4030 ms. (9 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 4 ms. (80 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
SDD proceeding with computation,250 properties remain. new max is 4
BEST_FIRST walk for 404 steps (4 resets) in 5 ms. (67 steps per ms) remains 250/250 properties
SDD size :1 after 3
BEST_FIRST walk for 404 steps (4 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 404 steps (4 resets) in 4 ms. (80 steps per ms) remains 250/250 properties
SDD proceeding with computation,250 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,250 properties remain. new max is 16
SDD size :18 after 81
SDD proceeding with computation,250 properties remain. new max is 32
SDD size :81 after 13122
SDD proceeding with computation,250 properties remain. new max is 64
SDD size :13122 after 1.2914e+08
Probabilistic random walk after 100001 steps, saw 34072 distinct states, run finished after 2690 ms. (steps per millisecond=37 ) properties seen :0
[2026-06-01 09:50:59] [INFO ] Invariant cache hit.
[2026-06-01 09:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 152/402 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 2.0))
(s1 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s53 0.0)
(s54 0.0)
(s56 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s115 2.0)
(s116 (/ 1.0 2.0))
(s117 (/ 3.0 2.0))
(s118 (/ 3.0 2.0))
(s119 (/ 3.0 2.0))
(s120 (/ 3.0 2.0))
(s121 (/ 3.0 2.0))
(s122 (/ 3.0 2.0))
(s123 0.0)
(s124 (/ 3.0 2.0))
(s125 (/ 3.0 2.0))
(s126 (/ 3.0 2.0))
(s127 (/ 3.0 2.0))
(s128 (/ 3.0 2.0))
(s129 (/ 3.0 2.0))
(s130 (/ 3.0 2.0))
(s131 (/ 3.0 2.0))
(s132 (/ 3.0 2.0))
(s133 (/ 3.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 3.0 2.0))
(s136 (/ 3.0 2.0))
(s137 2.0)
(s138 2.0)
(s139 (/ 3.0 2.0))
(s140 2.0)
(s141 2.0)
(s142 2.0)
(s143 (/ 3.0 2.0))
(s144 (/ 3.0 2.0))
(s145 0.0)
(s146 (/ 3.0 2.0))
(s147 (/ 3.0 2.0))
(s148 (/ 3.0 2.0))
(s149 (/ 3.0 2.0))
(s150 (/ 3.0 2.0))
(s151 (/ 3.0 2.0))
(s152 (/ 3.0 2.0))
(s153 (/ 3.0 2.0))
(s154 (/ 3.0 2.0))
(s155 (/ 3.0 2.0))
(s156 0.0)
(s157 (/ 3.0 2.0))
(s158 (/ 3.0 2.0))
(s159 (/ 3.0 2.0))
(s160 (/ 3.0 2.0))
(s161 (/ 3.0 2.0))
(s162 (/ 3.0 2.0))
(s163 (/ 3.0 2.0))
(s164 (/ 3.0 2.0))
(s165 (/ 3.0 2.0))
(s166 (/ 3.0 2.0))
(s167 0.0)
(s168 (/ 3.0 2.0))
(s169 (/ 3.0 2.0))
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 (/ 1.0 2.0))
(s193 0.0)
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s197 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s199 0.0)
(s200 (/ 1.0 2.0))
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 (/ 1.0 2.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 (/ 3.0 2.0))
(s222 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 3.0 2.0))
(s225 (/ 3.0 2.0))
(s234 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s281 0.0)
(s282 (/ 3.0 2.0))
(s283 (/ 3.0 2.0))
(s284 (/ 3.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 3.0 2.0))
(s287 (/ 3.0 2.0))
(s288 (/ 3.0 2.0))
(s289 (/ 1.0 2.0))
(s290 (/ 3.0 2.0))
(s291 (/ 3.0 2.0))
(s292 (/ 3.0 2.0))
(s293 (/ 3.0 2.0))
(s294 (/ 3.0 2.0))
(s295 (/ 3.0 2.0))
(s296 (/ 3.0 2.0))
(s297 (/ 3.0 2.0))
(s298 (/ 3.0 2.0))
(s299 (/ 3.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 3.0 2.0))
(s302 (/ 3.0 2.0))
(s303 (/ 3.0 2.0))
(s304 (/ 3.0 2.0))
(s305 (/ 3.0 2.0))
(s306 (/ 3.0 2.0))
(s307 (/ 3.0 2.0))
(s308 (/ 3.0 2.0))
(s309 (/ 3.0 2.0))
(s310 (/ 3.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 3.0 2.0))
(s313 (/ 3.0 2.0))
(s314 (/ 3.0 2.0))
(s315 (/ 3.0 2.0))
(s316 (/ 3.0 2.0))
(s317 (/ 3.0 2.0))
(s318 (/ 3.0 2.0))
(s319 (/ 3.0 2.0))
(s320 (/ 3.0 2.0))
(s321 (/ 3.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 3.0 2.0))
(s324 (/ 3.0 2.0))
(s325 (/ 3.0 2.0))
(s326 (/ 3.0 2.0))
(s327 (/ 3.0 2.0))
(s328 (/ 3.0 2.0))
(s329 (/ 3.0 2.0))
(s330 (/ 3.0 2.0))
(s331 (/ 3.0 2.0))
(s332 (/ 3.0 2.0))
(s333 (/ 3.0 2.0))
(s334 (/ 1.0 2.0))
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s345 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s367 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 (/ 1.0 2.0))
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 (/ 1.0 2.0))
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 (/ 1.0 2.0))
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 (/ 1.0 2.0))
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s467 0.0)
(s478 0.0)
(s489 0.0)
(s500 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 (/ 1.0 2.0))
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 (/ 3.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 0.0)
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s571 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 0.0)
(s579 (/ 1.0 2.0))
(s580 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 (/ 1.0 2.0))
(s592 (/ 1.0 2.0))
(s593 (/ 1.0 2.0))
(s594 (/ 1.0 2.0))
(s595 (/ 1.0 2.0))
(s596 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 0.0)
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s605 (/ 1.0 2.0))
(s606 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1057 variables, and 150 constraints, problems are : Problem set: 0 solved, 250 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 100/102 constraints, Generalized P Invariants (flows): 50/250 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (OVERLAPS) 152/402 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:51:07] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 6 ms to minimize.
Problem osplace_115 is UNSAT
Problem osplace_116 is UNSAT
Problem osplace_117 is UNSAT
Problem osplace_118 is UNSAT
Problem osplace_119 is UNSAT
Problem osplace_120 is UNSAT
Problem osplace_121 is UNSAT
Problem osplace_122 is UNSAT
Problem osplace_123 is UNSAT
Problem osplace_124 is UNSAT
Problem osplace_125 is UNSAT
Problem osplace_126 is UNSAT
Problem osplace_127 is UNSAT
Problem osplace_128 is UNSAT
Problem osplace_129 is UNSAT
Problem osplace_130 is UNSAT
Problem osplace_131 is UNSAT
Problem osplace_132 is UNSAT
Problem osplace_133 is UNSAT
Problem osplace_134 is UNSAT
Problem osplace_135 is UNSAT
Problem osplace_136 is UNSAT
Problem osplace_137 is UNSAT
Problem osplace_138 is UNSAT
Problem osplace_139 is UNSAT
Problem osplace_140 is UNSAT
Problem osplace_141 is UNSAT
Problem osplace_142 is UNSAT
Problem osplace_143 is UNSAT
Problem osplace_144 is UNSAT
Problem osplace_145 is UNSAT
Problem osplace_146 is UNSAT
Problem osplace_147 is UNSAT
Problem osplace_148 is UNSAT
Problem osplace_149 is UNSAT
Problem osplace_150 is UNSAT
Problem osplace_151 is UNSAT
Problem osplace_152 is UNSAT
Problem osplace_153 is UNSAT
Problem osplace_154 is UNSAT
Problem osplace_155 is UNSAT
Problem osplace_156 is UNSAT
Problem osplace_157 is UNSAT
Problem osplace_158 is UNSAT
Problem osplace_159 is UNSAT
Problem osplace_160 is UNSAT
Problem osplace_161 is UNSAT
Problem osplace_162 is UNSAT
Problem osplace_163 is UNSAT
Problem osplace_164 is UNSAT
Problem osplace_165 is UNSAT
Problem osplace_166 is UNSAT
Problem osplace_167 is UNSAT
Problem osplace_168 is UNSAT
Problem osplace_169 is UNSAT
Problem osplace_170 is UNSAT
Problem osplace_171 is UNSAT
Problem osplace_172 is UNSAT
Problem osplace_173 is UNSAT
Problem osplace_174 is UNSAT
Problem osplace_175 is UNSAT
Problem osplace_176 is UNSAT
Problem osplace_177 is UNSAT
Problem osplace_178 is UNSAT
Problem osplace_179 is UNSAT
Problem osplace_180 is UNSAT
Problem osplace_181 is UNSAT
Problem osplace_182 is UNSAT
Problem osplace_183 is UNSAT
Problem osplace_184 is UNSAT
Problem osplace_185 is UNSAT
Problem osplace_186 is UNSAT
Problem osplace_187 is UNSAT
Problem osplace_188 is UNSAT
Problem osplace_189 is UNSAT
Problem osplace_190 is UNSAT
Problem osplace_191 is UNSAT
Problem osplace_192 is UNSAT
Problem osplace_193 is UNSAT
Problem osplace_194 is UNSAT
Problem osplace_195 is UNSAT
Problem osplace_196 is UNSAT
Problem osplace_197 is UNSAT
Problem osplace_198 is UNSAT
Problem osplace_199 is UNSAT
Problem osplace_200 is UNSAT
Problem osplace_201 is UNSAT
Problem osplace_202 is UNSAT
Problem osplace_203 is UNSAT
Problem osplace_204 is UNSAT
Problem osplace_205 is UNSAT
Problem osplace_206 is UNSAT
Problem osplace_207 is UNSAT
Problem osplace_208 is UNSAT
Problem osplace_209 is UNSAT
Problem osplace_210 is UNSAT
Problem osplace_211 is UNSAT
Problem osplace_212 is UNSAT
Problem osplace_213 is UNSAT
Problem osplace_214 is UNSAT
Problem osplace_215 is UNSAT
Problem osplace_216 is UNSAT
Problem osplace_217 is UNSAT
Problem osplace_218 is UNSAT
Problem osplace_219 is UNSAT
Problem osplace_220 is UNSAT
Problem osplace_221 is UNSAT
Problem osplace_222 is UNSAT
Problem osplace_223 is UNSAT
Problem osplace_224 is UNSAT
Problem osplace_225 is UNSAT
Problem osplace_234 is UNSAT
Problem osplace_245 is UNSAT
Problem osplace_256 is UNSAT
Problem osplace_267 is UNSAT
Problem osplace_278 is UNSAT
Problem osplace_282 is UNSAT
Problem osplace_283 is UNSAT
Problem osplace_284 is UNSAT
Problem osplace_285 is UNSAT
Problem osplace_286 is UNSAT
Problem osplace_287 is UNSAT
Problem osplace_288 is UNSAT
Problem osplace_289 is UNSAT
Problem osplace_290 is UNSAT
Problem osplace_291 is UNSAT
Problem osplace_292 is UNSAT
Problem osplace_293 is UNSAT
Problem osplace_294 is UNSAT
Problem osplace_295 is UNSAT
Problem osplace_296 is UNSAT
Problem osplace_297 is UNSAT
Problem osplace_298 is UNSAT
Problem osplace_299 is UNSAT
Problem osplace_300 is UNSAT
Problem osplace_301 is UNSAT
Problem osplace_302 is UNSAT
Problem osplace_303 is UNSAT
Problem osplace_304 is UNSAT
Problem osplace_305 is UNSAT
Problem osplace_306 is UNSAT
Problem osplace_307 is UNSAT
Problem osplace_308 is UNSAT
Problem osplace_309 is UNSAT
Problem osplace_310 is UNSAT
Problem osplace_311 is UNSAT
Problem osplace_312 is UNSAT
Problem osplace_313 is UNSAT
Problem osplace_314 is UNSAT
Problem osplace_315 is UNSAT
Problem osplace_316 is UNSAT
Problem osplace_317 is UNSAT
Problem osplace_318 is UNSAT
Problem osplace_319 is UNSAT
Problem osplace_320 is UNSAT
Problem osplace_321 is UNSAT
Problem osplace_322 is UNSAT
Problem osplace_323 is UNSAT
Problem osplace_324 is UNSAT
Problem osplace_325 is UNSAT
Problem osplace_326 is UNSAT
Problem osplace_327 is UNSAT
Problem osplace_328 is UNSAT
Problem osplace_329 is UNSAT
Problem osplace_330 is UNSAT
Problem osplace_331 is UNSAT
Problem osplace_332 is UNSAT
Problem osplace_333 is UNSAT
Problem osplace_334 is UNSAT
Problem osplace_335 is UNSAT
Problem osplace_336 is UNSAT
Problem osplace_337 is UNSAT
Problem osplace_345 is UNSAT
Problem osplace_356 is UNSAT
Problem osplace_367 is UNSAT
Problem osplace_378 is UNSAT
Problem osplace_389 is UNSAT
Problem osplace_400 is UNSAT
Problem osplace_411 is UNSAT
Problem osplace_422 is UNSAT
Problem osplace_433 is UNSAT
Problem osplace_444 is UNSAT
Problem osplace_445 is UNSAT
Problem osplace_555 is UNSAT
Problem osplace_562 is UNSAT
Problem osplace_563 is UNSAT
Problem osplace_564 is UNSAT
Problem osplace_565 is UNSAT
Problem osplace_566 is UNSAT
Problem osplace_568 is UNSAT
Problem osplace_569 is UNSAT
Problem osplace_570 is UNSAT
Problem osplace_571 is UNSAT
Problem osplace_572 is UNSAT
Problem osplace_573 is UNSAT
Problem osplace_574 is UNSAT
Problem osplace_575 is UNSAT
Problem osplace_576 is UNSAT
Problem osplace_577 is UNSAT
Problem osplace_579 is UNSAT
Problem osplace_580 is UNSAT
Problem osplace_581 is UNSAT
Problem osplace_582 is UNSAT
Problem osplace_583 is UNSAT
Problem osplace_584 is UNSAT
Problem osplace_585 is UNSAT
Problem osplace_586 is UNSAT
Problem osplace_587 is UNSAT
Problem osplace_588 is UNSAT
Problem osplace_590 is UNSAT
Problem osplace_591 is UNSAT
Problem osplace_592 is UNSAT
Problem osplace_593 is UNSAT
Problem osplace_594 is UNSAT
Problem osplace_595 is UNSAT
Problem osplace_596 is UNSAT
Problem osplace_597 is UNSAT
Problem osplace_598 is UNSAT
Problem osplace_599 is UNSAT
Problem osplace_601 is UNSAT
Problem osplace_602 is UNSAT
Problem osplace_603 is UNSAT
Problem osplace_604 is UNSAT
Problem osplace_605 is UNSAT
Problem osplace_606 is UNSAT
Problem osplace_607 is UNSAT
Problem osplace_608 is UNSAT
Problem osplace_609 is UNSAT
Problem osplace_610 is UNSAT
Problem osplace_612 is UNSAT
Problem osplace_613 is UNSAT
Problem osplace_614 is UNSAT
Problem osplace_615 is UNSAT
Problem osplace_616 is UNSAT
Problem osplace_621 is UNSAT
Problem osplace_632 is UNSAT
Problem osplace_643 is UNSAT
Problem osplace_0 is UNSAT
Problem osplace_1 is UNSAT
Problem osplace_12 is UNSAT
Problem osplace_23 is UNSAT
Problem osplace_34 is UNSAT
Problem osplace_45 is UNSAT
Problem osplace_56 is UNSAT
Problem osplace_67 is UNSAT
Problem osplace_78 is UNSAT
Problem osplace_89 is UNSAT
Problem osplace_100 is UNSAT
Problem osplace_111 is UNSAT
Problem osplace_112 is UNSAT
After SMT solving in domain Int declared 402/1057 variables, and 151 constraints, problems are : Problem set: 250 solved, 0 unsolved in 2578 ms.
Refiners :[Positive P Invariants (semi-flows): 100/102 constraints, Generalized P Invariants (flows): 50/250 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/250 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7705ms problems are : Problem set: 250 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query OneSafe after proving 903 properties.
FORMULA OneSafe TRUE TECHNIQUES INVARIANTS SMT_REFINEMENT SAT_SMT STRUCTURAL
Total runtime 13043 ms.

BK_STOP 1780307467452

--------------------
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
+ [[ OneSafe = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution OneSafe -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination OneSafe -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="SupplyChain-PT-00050"
export BK_EXAMINATION="OneSafe"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is SupplyChain-PT-00050, examination is OneSafe"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r368-tall-178024404800125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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