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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1212.792 31471.00 87031.00 57.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-178024403900138.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-00500, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r360-tall-178024403900138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.4K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 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 2.1M 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 1780293580208

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-00500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-06-01 05:59:41] [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:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 05:59:41] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2026-06-01 05:59:41] [INFO ] Transformed 6504 places.
[2026-06-01 05:59:41] [INFO ] Transformed 4003 transitions.
[2026-06-01 05:59:41] [INFO ] Parsed PT model containing 6504 places and 4003 transitions and 18006 arcs in 382 ms.
[2026-06-01 05:59:43] [INFO ] Flatten gal took : 799 ms
[2026-06-01 05:59:43] [INFO ] Flatten gal took : 399 ms
[2026-06-01 05:59:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9612697367334022331.gal : 184 ms
[2026-06-01 05:59:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15056674283530809092.prop : 34 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/ReachabilityCardinality9612697367334022331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15056674283530809092.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 ...329
Loading property file /tmp/ReachabilityCardinality15056674283530809092.prop.
RANDOM walk for 40000 steps (16 resets) in 15901 ms. (2 steps per ms) remains 1459/6504 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 21 ms. (5 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 18 ms. (6 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 29 ms. (4 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 1459/1459 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11080376841744696716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16704879479887008003.kers'
[2026-06-01 05:59:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11080376841744696716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16704879479887008003.kers]
Normalized transition count is 4002 out of 4003 initially.
Culling duplicate invariants (modulo rational): removing 1590 columns.
Culled 1590 columns in 5 ms.
// Phase 1: matrix 4002 rows 4914 cols 13004 entries
Finished phase 1 with 2912 SingleSign rule and 500 generalized
[2026-06-01 05:59:46] [INFO ] Computed 3092 invariants in 32 ms
Computed 3092 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-16704879479887008003.kers
Total runtime 37 ms.
[2026-06-01 05:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1459 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1459 unsolved
SMT process timed out in 5951ms, After SMT, problems are : Problem set: 0 solved, 1459 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1459 out of 6504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6504/6504 places, 4003/4003 transitions.
Ensure Unique test removed 1031 places
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1032 rules applied. Total rules applied 1032 place count 5473 transition count 4002
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1032 place count 5473 transition count 3502
Deduced a syphon composed of 500 places in 2 ms
Ensure Unique test removed 500 places
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 1 with 1500 rules applied. Total rules applied 2532 place count 4473 transition count 3502
Free-agglomeration rule applied 910 times.
Iterating global reduction 1 with 910 rules applied. Total rules applied 3442 place count 4473 transition count 2592
Ensure Unique test removed 500 places
Reduce places removed 1410 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 1 with 2410 rules applied. Total rules applied 5852 place count 3063 transition count 1592
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 2 with 500 rules applied. Total rules applied 6352 place count 2563 transition count 1592
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 6352 place count 2563 transition count 1092
Deduced a syphon composed of 500 places in 0 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 7352 place count 2063 transition count 1092
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 7370 place count 2063 transition count 1074
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 7388 place count 2045 transition count 1074
Applied a total of 7388 rules in 1492 ms. Remains 2045 /6504 variables (removed 4459) and now considering 1074/4003 (removed 2929) transitions.
Running 502 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-10765775563530275669.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10937985677423545675.kers'
[2026-06-01 05:59:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10765775563530275669.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10937985677423545675.kers]
Culling duplicate invariants (modulo rational): removing 559 columns.
Culled 559 columns in 1 ms.
// Phase 1: matrix 1074 rows 1486 cols 3648 entries
Finished phase 1 with 984 SingleSign rule and 0 generalized
[2026-06-01 05:59:53] [INFO ] Computed 1061 invariants in 11 ms
Computed 1061 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-10937985677423545675.kers
Total runtime 13 ms.
[2026-06-01 05:59:53] [INFO ] State equation strengthened by 18 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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 TDEAD18 is UNSAT
Problem TDEAD19 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 TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 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 TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1972 variables, 1/1 constraints. Problems are: Problem set: 410 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1972 variables, 559/560 constraints. Problems are: Problem set: 410 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1972 variables, 0/560 constraints. Problems are: Problem set: 410 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 73/2045 variables, 501/1061 constraints. Problems are: Problem set: 410 solved, 92 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/2045 variables, 1/1062 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2045 variables, 0/1062 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1074/3119 variables, 2045/3107 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3119 variables, 18/3125 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3119 variables, 0/3125 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3119 variables, 0/3125 constraints. Problems are: Problem set: 500 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3119/3119 variables, and 3125 constraints, problems are : Problem set: 500 solved, 2 unsolved in 14848 ms.
Refiners :[Positive P Invariants (semi-flows): 502/502 constraints, Generalized P Invariants (flows): 559/559 constraints, State Equation: 2045/2045 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 502/501 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 500 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 415/415 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/917 variables, 0/415 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 573/1490 variables, 501/916 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1490 variables, 0/916 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 411/1901 variables, 1/917 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1901 variables, 0/917 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/2045 variables, 144/1061 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 1/1062 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2045 variables, 0/1062 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1074/3119 variables, 2045/3107 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3119 variables, 18/3125 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 1/3126 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3119 variables, 0/3126 constraints. Problems are: Problem set: 500 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3119 variables, 0/3126 constraints. Problems are: Problem set: 500 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3119/3119 variables, and 3126 constraints, problems are : Problem set: 500 solved, 2 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 502/502 constraints, Generalized P Invariants (flows): 559/559 constraints, State Equation: 2045/2045 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/501 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17574ms problems are : Problem set: 500 solved, 2 unsolved
Search for dead transitions found 500 dead transitions in 17581ms
Found 500 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 500 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2045/6504 places, 574/4003 transitions.
Deduced a syphon composed of 410 places in 0 ms
Applied a total of 0 rules in 67 ms. Remains 2045 /2045 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19167 ms. Remains : 2045/6504 places, 574/4003 transitions.
Deduced a syphon composed of 410 places in 0 ms
Reduce places removed 410 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 30260 ms.

BK_STOP 1780293611679

--------------------
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-00500"
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-00500, 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-178024403900138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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