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.r354-tall-178024402900247.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-03000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.7K May 27 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 27 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 07:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 07:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 27 11:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 11:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 11:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 27 07:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 07:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:01 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 13M 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-00
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-01
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-02
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-03
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-04
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-05
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-06
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-07
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-08
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-09
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-10
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-11
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-12
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-13
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-14
FORMULA_NAME SupplyChain-PT-03000-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780266888603

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-03000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-31 22:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 22:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 22:34:50] [INFO ] Load time of PNML (sax parser for PT used): 756 ms
[2026-05-31 22:34:50] [INFO ] Transformed 39004 places.
[2026-05-31 22:34:51] [INFO ] Transformed 24003 transitions.
[2026-05-31 22:34:51] [INFO ] Parsed PT model containing 39004 places and 24003 transitions and 108006 arcs in 1051 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2026-05-31 22:35:00] [INFO ] Flatten gal took : 9039 ms
RANDOM walk for 40000 steps (8 resets) in 44585 ms. (0 steps per ms) remains 6/16 properties
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4301 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4889 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4442 ms. (9 steps per ms) remains 6/6 properties
[2026-05-31 22:35:07] [INFO ] Flatten gal took : 6622 ms
[2026-05-31 22:35:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality961270296560260559.gal : 437 ms
[2026-05-31 22:35:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4967799479590904455.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality961270296560260559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4967799479590904455.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 ...327
BEST_FIRST walk for 40004 steps (8 resets) in 4869 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5355 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3878 ms. (10 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15662037386711960978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17765510566047582540.kers'
[2026-05-31 22:35:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15662037386711960978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17765510566047582540.kers]
Normalized transition count is 24002 out of 24003 initially.
Culling duplicate invariants (modulo rational): removing 9090 columns.
Culled 9090 columns in 51 ms.
// Phase 1: matrix 24002 rows 29914 cols 78004 entries
Finished phase 1 with 17912 SingleSign rule and 3000 generalized
[2026-05-31 22:35:11] [INFO ] Computed 18092 invariants in 295 ms
Computed 18092 P flows in 298 ms.
Exported basis to /tmp/petrispot-output-17765510566047582540.kers
Total runtime 323 ms.
[2026-05-31 22:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem SupplyChain-PT-03000-ReachabilityFireability-2024-00 is UNSAT
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem SupplyChain-PT-03000-ReachabilityFireability-2024-06 is UNSAT
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 3443/3607 variables, 149/170 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/3607 variables, 2/172 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3607 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 24941/63007 variables, and 6025 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 6002/6002 constraints, Generalized P Invariants (flows): 23/12090 constraints, State Equation: 0/39004 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3264/3359 variables, 88/99 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3359 variables, 1/100 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3359 variables, 1/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3359 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 10940ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 95 out of 39004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39004/39004 places, 24003/24003 transitions.
Graph (complete) has 102362 edges and 39004 vertex of which 33001 are kept as prefixes of interest. Removing 6003 places using SCC suffix rule.65 ms
Discarding 6003 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 6079 places
Iterating post reduction 0 with 6079 rules applied. Total rules applied 6080 place count 26922 transition count 24000
Performed 2982 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2982 Pre rules applied. Total rules applied 6080 place count 26922 transition count 21018
Deduced a syphon composed of 2982 places in 17 ms
Ensure Unique test removed 2982 places
Reduce places removed 5964 places and 0 transitions.
Iterating global reduction 1 with 8946 rules applied. Total rules applied 15026 place count 20958 transition count 21018
Free-agglomeration rule applied 5867 times.
Iterating global reduction 1 with 5867 rules applied. Total rules applied 20893 place count 20958 transition count 15151
Ensure Unique test removed 2979 places
Reduce places removed 8846 places and 0 transitions.
Ensure Unique test removed 2979 transitions
Reduce isomorphic transitions removed 2979 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2957 transitions
Trivial Post-agglo rules discarded 2957 transitions
Performed 2957 trivial Post agglomeration. Transition count delta: 2957
Iterating post reduction 1 with 14782 rules applied. Total rules applied 35675 place count 12112 transition count 9215
Reduce places removed 2957 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 2961 rules applied. Total rules applied 38636 place count 9155 transition count 9211
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 38640 place count 9151 transition count 9211
Performed 2975 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2975 Pre rules applied. Total rules applied 38640 place count 9151 transition count 6236
Deduced a syphon composed of 2975 places in 4 ms
Reduce places removed 2975 places and 0 transitions.
Iterating global reduction 4 with 5950 rules applied. Total rules applied 44590 place count 6176 transition count 6236
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44594 place count 6176 transition count 6232
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 44598 place count 6172 transition count 6232
Applied a total of 44598 rules in 16846 ms. Remains 6172 /39004 variables (removed 32832) and now considering 6232/24003 (removed 17771) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16855 ms. Remains : 6172/39004 places, 6232/24003 transitions.
RANDOM walk for 40000 steps (274 resets) in 7606 ms. (5 steps per ms) remains 3/4 properties
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2525 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2229 ms. (17 steps per ms) remains 2/3 properties
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2105 ms. (18 steps per ms) remains 1/2 properties
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4703775987979659861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16866478760173766541.kers'
[2026-05-31 22:35:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4703775987979659861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16866478760173766541.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 6 ms.
// Phase 1: matrix 6232 rows 6161 cols 12581 entries
Finished phase 1 with 6082 SingleSign rule and 39 generalized
[2026-05-31 22:35:44] [INFO ] Computed 51 invariants in 1354 ms
Computed 51 P flows in 1358 ms.
Exported basis to /tmp/petrispot-output-16866478760173766541.kers
Total runtime 1366 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2995/3066 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3066 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/3103 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3103 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3206/6309 variables, 3103/3142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6309 variables, 0/3142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6026/12335 variables, 3026/6168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12335 variables, 1/6169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12335 variables, 0/6169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/12336 variables, 1/6170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12336 variables, 1/6171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12336 variables, 0/6171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 53/12389 variables, 27/6198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12389 variables, 5/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/12389 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/12394 variables, 5/6208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/12394 variables, 5/6213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/12394 variables, 0/6213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/12404 variables, 10/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/12404 variables, 0/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/12404 variables, 0/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12404/12404 variables, and 6223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 6172/6172 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2995/3066 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3066 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/3103 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3103 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality4967799479590904455.prop.
At refinement iteration 6 (OVERLAPS) 3206/6309 variables, 3103/3142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6309 variables, 0/3142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6026/12335 variables, 3026/6168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12335 variables, 1/6169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12335 variables, 0/6169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/12336 variables, 1/6170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12336 variables, 1/6171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12336 variables, 0/6171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 53/12389 variables, 27/6198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12389 variables, 5/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/12389 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/12394 variables, 5/6208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/12394 variables, 5/6213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/12394 variables, 0/6213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/12404 variables, 10/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/12404 variables, 0/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/12404 variables, 0/6223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12404/12404 variables, and 6223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 6172/6172 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10375ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1211 steps, including 0 resets, run visited all 1 properties in 269 ms. (steps per millisecond=4 )
FORMULA SupplyChain-PT-03000-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 288 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 63789 ms.

BK_STOP 1780266953820

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SupplyChain-PT-03000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is SupplyChain-PT-03000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402900247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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