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

About the Execution of ITS-Tools for SupplyChain-PT-00200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
713.504 13394.00 39032.00 64.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.r360-tall-178024403900133.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 itstools
Input is SupplyChain-PT-00200, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r360-tall-178024403900133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 27 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:59 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 820K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1780293548796

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SupplyChain-PT-00200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-06-01 05:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-01 05:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 05:59:10] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-06-01 05:59:10] [INFO ] Transformed 2604 places.
[2026-06-01 05:59:10] [INFO ] Transformed 1603 transitions.
[2026-06-01 05:59:10] [INFO ] Parsed PT model containing 2604 places and 1603 transitions and 7206 arcs in 240 ms.
[2026-06-01 05:59:11] [INFO ] Flatten gal took : 518 ms
[2026-06-01 05:59:11] [INFO ] Flatten gal took : 271 ms
[2026-06-01 05:59:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14047765278403968560.gal : 89 ms
[2026-06-01 05:59:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16656516894390003795.prop : 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14047765278403968560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16656516894390003795.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16656516894390003795.prop.
RANDOM walk for 40000 steps (48 resets) in 7464 ms. (5 steps per ms) remains 499/2604 properties
BEST_FIRST walk for 404 steps (0 resets) in 17 ms. (22 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 18 ms. (21 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 14 ms. (26 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 16 ms. (23 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 22 ms. (17 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 17 ms. (22 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 499/499 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 499/499 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3193884637307886730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9381667907909598831.kers'
[2026-06-01 05:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3193884637307886730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9381667907909598831.kers]
Normalized transition count is 1602 out of 1603 initially.
Culling duplicate invariants (modulo rational): removing 690 columns.
Culled 690 columns in 2 ms.
// Phase 1: matrix 1602 rows 1914 cols 5204 entries
Finished phase 1 with 1112 SingleSign rule and 200 generalized
[2026-06-01 05:59:12] [INFO ] Computed 1292 invariants in 10 ms
Computed 1292 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-9381667907909598831.kers
Total runtime 13 ms.
[2026-06-01 05:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Invariant property smplace_2168 does not hold.
Invariant property smplace_1945 does not hold.
Invariant property smplace_1179 does not hold.
Invariant property smplace_897 does not hold.
Invariant property smplace_676 does not hold.
SDD proceeding with computation,2599 properties remain. new max is 2
SDD size :1 after 3
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 499 unsolved
SMT process timed out in 5462ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 499 out of 2604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2604/2604 places, 1603/1603 transitions.
Ensure Unique test removed 472 places
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 2132 transition count 1602
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 473 place count 2132 transition count 1402
Invariant property smplace_2169 does not hold.
Deduced a syphon composed of 200 places in 2 ms
Ensure Unique test removed 200 places
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 1 with 600 rules applied. Total rules applied 1073 place count 1732 transition count 1402
Free-agglomeration rule applied 310 times.
Iterating global reduction 1 with 310 rules applied. Total rules applied 1383 place count 1732 transition count 1092
Ensure Unique test removed 200 places
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 910 rules applied. Total rules applied 2293 place count 1222 transition count 692
Reduce places removed 200 places and 0 transitions.
Invariant property smplace_1946 does not hold.
Iterating post reduction 2 with 200 rules applied. Total rules applied 2493 place count 1022 transition count 692
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2493 place count 1022 transition count 492
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2893 place count 822 transition count 492
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 3 with 40 rules applied. Total rules applied 2933 place count 822 transition count 452
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 2973 place count 782 transition count 452
Applied a total of 2973 rules in 557 ms. Remains 782 /2604 variables (removed 1822) and now considering 452/1603 (removed 1151) transitions.
Running 202 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7584811370445498810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7985255577431989956.kers'
[2026-06-01 05:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7584811370445498810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7985255577431989956.kers]
Culling duplicate invariants (modulo rational): removing 218 columns.
Culled 218 columns in 0 ms.
// Phase 1: matrix 452 rows 564 cols 1504 entries
Finished phase 1 with 362 SingleSign rule and 0 generalized
[2026-06-01 05:59:18] [INFO ] Computed 420 invariants in 2 ms
Computed 420 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7985255577431989956.kers
Total runtime 3 ms.
[2026-06-01 05:59:18] [INFO ] State equation strengthened by 40 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Invariant property smplace_1190 does not hold.
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Invariant property smplace_898 does not hold.
Invariant property smplace_677 does not hold.
At refinement iteration 0 (INCLUDED_ONLY) 0/731 variables, 1/1 constraints. Problems are: Problem set: 110 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/731 variables, 218/219 constraints. Problems are: Problem set: 110 solved, 92 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/731 variables, 1/220 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/731 variables, 0/220 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 51/782 variables, 201/421 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/421 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 452/1234 variables, 782/1203 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1234 variables, 40/1243 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1234 variables, 0/1243 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1234 variables, 0/1243 constraints. Problems are: Problem set: 200 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1243 constraints, problems are : Problem set: 200 solved, 2 unsolved in 2343 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, Generalized P Invariants (flows): 218/218 constraints, State Equation: 782/782 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 202/201 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 200 solved, 2 unsolved
SDD proceeding with computation,2594 properties remain. new max is 2
SDD size :3 after 7
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 118/118 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/118 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 251/571 variables, 201/319 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 0/319 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 111/682 variables, 1/320 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 0/320 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 100/782 variables, 100/420 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 1/421 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/421 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 452/1234 variables, 782/1203 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1234 variables, 40/1243 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1234 variables, 1/1244 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1234 variables, 0/1244 constraints. Problems are: Problem set: 200 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1234 variables, 0/1244 constraints. Problems are: Problem set: 200 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1244 constraints, problems are : Problem set: 200 solved, 2 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, Generalized P Invariants (flows): 218/218 constraints, State Equation: 782/782 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/201 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3327ms problems are : Problem set: 200 solved, 2 unsolved
Search for dead transitions found 200 dead transitions in 3331ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 782/2604 places, 252/1603 transitions.
Deduced a syphon composed of 110 places in 1 ms
Applied a total of 0 rules in 23 ms. Remains 782 /782 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3934 ms. Remains : 782/2604 places, 252/1603 transitions.
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 12150 ms.

BK_STOP 1780293562190

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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-00200"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SupplyChain-PT-00200, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r360-tall-178024403900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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