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.r338-smll-178021499300469.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 FileSystem-PT-N05I10B15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 8.2K May 27 10:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 10:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 27 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 27 10:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 27 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 27 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 349K Jun 10 11:57 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781620843907

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N05I10B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-06-16 14:40:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 14:40:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 14:40:46] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2026-06-16 14:40:46] [INFO ] Transformed 826 places.
[2026-06-16 14:40:46] [INFO ] Transformed 770 transitions.
[2026-06-16 14:40:46] [INFO ] Parsed PT model containing 826 places and 770 transitions and 2750 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Reduce places removed 10 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10817378234313049290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11078660444775285200.kers'
[2026-06-16 14:40:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10817378234313049290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11078660444775285200.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 770 rows 801 cols 2300 entries
Finished phase 1 with 620 SingleSign rule and 140 generalized
[2026-06-16 14:40:46] [INFO ] Computed 56 invariants in 18 ms
Computed 56 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-11078660444775285200.kers
Total runtime 22 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FileSystem-PT-N05I10B15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (196 resets) in 118 ms. (84 steps per ms)
FORMULA FileSystem-PT-N05I10B15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140012 steps (426 resets) in 450 ms. (310 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-06-16 14:40:47] [INFO ] Invariant cache hit.
[2026-06-16 14:40:48] [INFO ] [Real]Absence check using 41 positive place invariants in 56 ms returned sat
[2026-06-16 14:40:48] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 14:40:48] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2026-06-16 14:40:48] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-16 14:40:49] [INFO ] [Real]Added 150 Read/Feed constraints in 106 ms returned sat
[2026-06-16 14:40:49] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:40:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 43 ms returned sat
[2026-06-16 14:40:49] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 17 ms returned sat
[2026-06-16 14:40:50] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2026-06-16 14:40:50] [INFO ] [Nat]Added 150 Read/Feed constraints in 467 ms returned unsat
[2026-06-16 14:40:50] [INFO ] [Real]Absence check using 41 positive place invariants in 49 ms returned sat
[2026-06-16 14:40:50] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 20 ms returned sat
[2026-06-16 14:40:51] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2026-06-16 14:40:51] [INFO ] [Real]Added 150 Read/Feed constraints in 327 ms returned unsat
[2026-06-16 14:40:52] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2026-06-16 14:40:52] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 17 ms returned sat
[2026-06-16 14:40:52] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2026-06-16 14:40:53] [INFO ] [Real]Added 150 Read/Feed constraints in 300 ms returned unsat
[2026-06-16 14:40:53] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2026-06-16 14:40:53] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 19 ms returned sat
[2026-06-16 14:40:53] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2026-06-16 14:40:54] [INFO ] [Real]Added 150 Read/Feed constraints in 168 ms returned unsat
[2026-06-16 14:40:54] [INFO ] [Real]Absence check using 41 positive place invariants in 56 ms returned sat
[2026-06-16 14:40:54] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 14:40:55] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2026-06-16 14:40:55] [INFO ] [Real]Added 150 Read/Feed constraints in 56 ms returned sat
[2026-06-16 14:40:55] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:40:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 46 ms returned sat
[2026-06-16 14:40:55] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 14:40:56] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2026-06-16 14:40:56] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:40:57] [INFO ] [Nat]Added 150 Read/Feed constraints in 1030 ms returned unknown
[2026-06-16 14:40:57] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2026-06-16 14:40:57] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 12 ms returned sat
[2026-06-16 14:40:58] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2026-06-16 14:40:58] [INFO ] [Real]Added 150 Read/Feed constraints in 155 ms returned sat
[2026-06-16 14:40:58] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:40:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 53 ms returned sat
[2026-06-16 14:40:58] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 18 ms returned sat
[2026-06-16 14:40:59] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2026-06-16 14:41:00] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:41:00] [INFO ] [Nat]Added 150 Read/Feed constraints in 799 ms returned unsat
[2026-06-16 14:41:00] [INFO ] [Real]Absence check using 41 positive place invariants in 32 ms returned sat
[2026-06-16 14:41:00] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 15 ms returned sat
[2026-06-16 14:41:01] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2026-06-16 14:41:01] [INFO ] [Real]Added 150 Read/Feed constraints in 322 ms returned unsat
[2026-06-16 14:41:01] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2026-06-16 14:41:01] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 14:41:02] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2026-06-16 14:41:02] [INFO ] [Real]Added 150 Read/Feed constraints in 115 ms returned sat
[2026-06-16 14:41:02] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:03] [INFO ] [Nat]Absence check using 41 positive place invariants in 52 ms returned sat
[2026-06-16 14:41:03] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 20 ms returned sat
[2026-06-16 14:41:03] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2026-06-16 14:41:04] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:41:04] [INFO ] [Nat]Added 150 Read/Feed constraints in 1037 ms returned unknown
[2026-06-16 14:41:05] [INFO ] [Real]Absence check using 41 positive place invariants in 31 ms returned sat
[2026-06-16 14:41:05] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 14 ms returned sat
[2026-06-16 14:41:05] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2026-06-16 14:41:05] [INFO ] [Real]Added 150 Read/Feed constraints in 118 ms returned sat
[2026-06-16 14:41:05] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 159 ms returned sat
[2026-06-16 14:41:06] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 19 ms returned sat
[2026-06-16 14:41:07] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2026-06-16 14:41:07] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:41:08] [INFO ] [Nat]Added 150 Read/Feed constraints in 1049 ms returned unknown
[2026-06-16 14:41:08] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2026-06-16 14:41:08] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 14:41:08] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2026-06-16 14:41:09] [INFO ] [Real]Added 150 Read/Feed constraints in 200 ms returned sat
[2026-06-16 14:41:09] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 50 ms returned sat
[2026-06-16 14:41:09] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 22 ms returned sat
[2026-06-16 14:41:10] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2026-06-16 14:41:10] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:41:10] [INFO ] [Nat]Added 150 Read/Feed constraints in 627 ms returned unsat
[2026-06-16 14:41:11] [INFO ] [Real]Absence check using 41 positive place invariants in 49 ms returned sat
[2026-06-16 14:41:11] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 25 ms returned sat
[2026-06-16 14:41:11] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2026-06-16 14:41:11] [INFO ] [Real]Added 150 Read/Feed constraints in 186 ms returned unsat
[2026-06-16 14:41:12] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2026-06-16 14:41:12] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 11 ms returned sat
[2026-06-16 14:41:12] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2026-06-16 14:41:12] [INFO ] [Real]Added 150 Read/Feed constraints in 101 ms returned unsat
[2026-06-16 14:41:12] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2026-06-16 14:41:12] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 13 ms returned sat
[2026-06-16 14:41:13] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2026-06-16 14:41:13] [INFO ] [Real]Added 150 Read/Feed constraints in 56 ms returned sat
[2026-06-16 14:41:13] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 48 ms returned sat
[2026-06-16 14:41:14] [INFO ] [Nat]Absence check using 41 positive and 15 generalized place invariants in 21 ms returned sat
[2026-06-16 14:41:14] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2026-06-16 14:41:15] [INFO ] SMT solver returned unknown. Retrying;
[2026-06-16 14:41:15] [INFO ] [Nat]Added 150 Read/Feed constraints in 1021 ms returned unknown
[2026-06-16 14:41:15] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2026-06-16 14:41:15] [INFO ] [Real]Absence check using 41 positive and 15 generalized place invariants in 12 ms returned sat
[2026-06-16 14:41:16] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2026-06-16 14:41:16] [INFO ] [Real]Added 150 Read/Feed constraints in 198 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0]
FORMULA FileSystem-PT-N05I10B15-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 770/770 transitions.
Graph (complete) has 1845 edges and 816 vertex of which 666 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.10 ms
Discarding 150 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 666 transition count 760
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 656 transition count 760
Discarding 135 places :
Symmetric choice reduction at 2 with 135 rule applications. Total rules 156 place count 521 transition count 625
Iterating global reduction 2 with 135 rules applied. Total rules applied 291 place count 521 transition count 625
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 2 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 324 rules applied. Total rules applied 615 place count 359 transition count 463
Free-agglomeration rule (complex) applied 147 times.
Iterating global reduction 2 with 147 rules applied. Total rules applied 762 place count 359 transition count 316
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 918 place count 203 transition count 316
Applied a total of 918 rules in 618 ms. Remains 203 /816 variables (removed 613) and now considering 316/770 (removed 454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 654 ms. Remains : 203/816 places, 316/770 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-459786667201626181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9826250113382864123.kers'
[2026-06-16 14:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-459786667201626181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9826250113382864123.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 316 rows 182 cols 792 entries
Finished phase 1 with 174 SingleSign rule and 6 generalized
[2026-06-16 14:41:17] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9826250113382864123.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (47619 resets) in 2066 ms. (483 steps per ms)
BEST_FIRST walk for 4000004 steps (27591 resets) in 2776 ms. (1440 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-16 14:41:22] [INFO ] Invariant cache hit.
[2026-06-16 14:41:22] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2026-06-16 14:41:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:41:22] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-06-16 14:41:22] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-16 14:41:22] [INFO ] [Real]Added 150 Read/Feed constraints in 34 ms returned sat
[2026-06-16 14:41:22] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-06-16 14:41:22] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2026-06-16 14:41:22] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Nat]Added 150 Read/Feed constraints in 353 ms returned unsat
[2026-06-16 14:41:23] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Real]Added 150 Read/Feed constraints in 46 ms returned sat
[2026-06-16 14:41:23] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:41:23] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Nat]Added 150 Read/Feed constraints in 319 ms returned unsat
[2026-06-16 14:41:24] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Real]Added 150 Read/Feed constraints in 38 ms returned sat
[2026-06-16 14:41:24] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2026-06-16 14:41:24] [INFO ] [Nat]Added 150 Read/Feed constraints in 199 ms returned unsat
[2026-06-16 14:41:25] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Real]Added 150 Read/Feed constraints in 30 ms returned sat
[2026-06-16 14:41:25] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:41:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2026-06-16 14:41:25] [INFO ] [Nat]Added 150 Read/Feed constraints in 446 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[0, 0, 0, 0]
FORMULA FileSystem-PT-N05I10B15-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FileSystem-PT-N05I10B15-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 39763 ms.

BK_STOP 1781620886057

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="FileSystem-PT-N05I10B15"
export BK_EXAMINATION="UpperBounds"
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 FileSystem-PT-N05I10B15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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