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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 5.8K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 21K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 191K 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-N02I10B08-UpperBounds-00
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-01
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-02
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-03
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-04
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-05
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-06
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-07
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-08
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-09
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-10
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-11
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-12
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-13
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-14
FORMULA_NAME FileSystem-PT-N02I10B08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1781620188475

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-N02I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-06-16 14:29:50] [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:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 14:29:51] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2026-06-16 14:29:51] [INFO ] Transformed 455 places.
[2026-06-16 14:29:51] [INFO ] Transformed 420 transitions.
[2026-06-16 14:29:51] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N02I10B08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0] Max Struct:[+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-2222378274088575288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2566498543553389616.kers'
[2026-06-16 14:29:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2222378274088575288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2566498543553389616.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 420 rows 437 cols 1250 entries
Finished phase 1 with 340 SingleSign rule and 70 generalized
[2026-06-16 14:29:51] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2566498543553389616.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 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, 1]
RANDOM walk for 10000 steps (2 resets) in 71 ms. (138 steps per ms)
FORMULA FileSystem-PT-N02I10B08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 88 ms. (561 steps per ms)
FORMULA FileSystem-PT-N02I10B08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-16 14:29:51] [INFO ] Invariant cache hit.
[2026-06-16 14:29:51] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2026-06-16 14:29:51] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 9 ms returned sat
[2026-06-16 14:29:52] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2026-06-16 14:29:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:29:52] [INFO ] [Real]Added 80 Read/Feed constraints in 49 ms returned sat
[2026-06-16 14:29:52] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:29:52] [INFO ] [Nat]Absence check using 27 positive place invariants in 26 ms returned sat
[2026-06-16 14:29:52] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 6 ms returned sat
[2026-06-16 14:29:52] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-06-16 14:29:53] [INFO ] [Nat]Added 80 Read/Feed constraints in 81 ms returned sat
[2026-06-16 14:29:53] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 55 ms.
[2026-06-16 14:29:53] [INFO ] Added : 70 causal constraints over 14 iterations in 900 ms. Result :sat
Minimization took 499 ms.
[2026-06-16 14:29:54] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2026-06-16 14:29:54] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 6 ms returned sat
[2026-06-16 14:29:54] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-06-16 14:29:54] [INFO ] [Real]Added 80 Read/Feed constraints in 24 ms returned sat
[2026-06-16 14:29:55] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:29:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 20 ms returned sat
[2026-06-16 14:29:55] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 8 ms returned sat
[2026-06-16 14:29:55] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2026-06-16 14:29:55] [INFO ] [Nat]Added 80 Read/Feed constraints in 28 ms returned sat
[2026-06-16 14:29:55] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 38 ms.
[2026-06-16 14:29:56] [INFO ] Added : 66 causal constraints over 14 iterations in 791 ms. Result :sat
Minimization took 282 ms.
[2026-06-16 14:29:56] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2026-06-16 14:29:56] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 8 ms returned sat
[2026-06-16 14:29:56] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2026-06-16 14:29:57] [INFO ] [Real]Added 80 Read/Feed constraints in 30 ms returned sat
[2026-06-16 14:29:57] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:29:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2026-06-16 14:29:57] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 7 ms returned sat
[2026-06-16 14:29:57] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2026-06-16 14:29:57] [INFO ] [Nat]Added 80 Read/Feed constraints in 68 ms returned sat
[2026-06-16 14:29:57] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 52 ms.
[2026-06-16 14:29:58] [INFO ] Added : 48 causal constraints over 10 iterations in 665 ms. Result :sat
Minimization took 401 ms.
[2026-06-16 14:29:58] [INFO ] [Real]Absence check using 27 positive place invariants in 45 ms returned sat
[2026-06-16 14:29:58] [INFO ] [Real]Absence check using 27 positive and 8 generalized place invariants in 6 ms returned sat
[2026-06-16 14:29:59] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2026-06-16 14:29:59] [INFO ] [Real]Added 80 Read/Feed constraints in 38 ms returned sat
[2026-06-16 14:29:59] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:29:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2026-06-16 14:29:59] [INFO ] [Nat]Absence check using 27 positive and 8 generalized place invariants in 8 ms returned sat
[2026-06-16 14:29:59] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2026-06-16 14:29:59] [INFO ] [Nat]Added 80 Read/Feed constraints in 59 ms returned sat
[2026-06-16 14:29:59] [INFO ] Computed and/alt/rep : 330/340/330 causal constraints (skipped 80 transitions) in 46 ms.
[2026-06-16 14:30:00] [INFO ] Added : 51 causal constraints over 11 iterations in 568 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FileSystem-PT-N02I10B08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FileSystem-PT-N02I10B08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 445 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place endloop_7_14) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 419/419 transitions.
Graph (complete) has 995 edges and 445 vertex of which 365 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.4 ms
Discarding 80 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 365 transition count 409
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 355 transition count 409
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 92 place count 284 transition count 338
Iterating global reduction 2 with 71 rules applied. Total rules applied 163 place count 284 transition count 338
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 339 place count 196 transition count 250
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 419 place count 196 transition count 170
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 2 with 87 rules applied. Total rules applied 506 place count 109 transition count 170
Applied a total of 506 rules in 225 ms. Remains 109 /445 variables (removed 336) and now considering 170/419 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 109/445 places, 170/419 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15933797451178393623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11948955169123100471.kers'
[2026-06-16 14:30:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15933797451178393623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11948955169123100471.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 170 rows 100 cols 430 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-06-16 14:30:01] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11948955169123100471.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 958 ms. (1042 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 506 ms. (1972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-06-16 14:30:02] [INFO ] Invariant cache hit.
[2026-06-16 14:30:02] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2026-06-16 14:30:03] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-06-16 14:30:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:30:03] [INFO ] [Real]Added 80 Read/Feed constraints in 25 ms returned sat
[2026-06-16 14:30:03] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:30:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-06-16 14:30:03] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-06-16 14:30:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 40 ms returned sat
[2026-06-16 14:30:03] [INFO ] Computed and/alt/rep : 80/90/80 causal constraints (skipped 80 transitions) in 18 ms.
[2026-06-16 14:30:03] [INFO ] Added : 8 causal constraints over 2 iterations in 66 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 170/170 transitions.
Applied a total of 0 rules in 14 ms. Remains 109 /109 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 109/109 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 170/170 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-06-16 14:30:03] [INFO ] Invariant cache hit.
[2026-06-16 14:30:03] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-06-16 14:30:03] [INFO ] Invariant cache hit.
[2026-06-16 14:30:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:30:04] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2026-06-16 14:30:04] [INFO ] Redundant transitions in 10 ms returned []
Running 160 sub problems to find dead transitions.
[2026-06-16 14:30:04] [INFO ] Invariant cache hit.
[2026-06-16 14:30:04] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 12/109 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 170/279 variables, 109/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 80/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 221 constraints, problems are : Problem set: 0 solved, 160 unsolved in 15346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 12/109 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 170/279 variables, 109/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 80/221 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 148/369 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/369 constraints. Problems are: Problem set: 12 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/369 constraints. Problems are: Problem set: 12 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 369 constraints, problems are : Problem set: 12 solved, 148 unsolved in 27818 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 148/160 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43292ms problems are : Problem set: 12 solved, 148 unsolved
Search for dead transitions found 12 dead transitions in 43306ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/109 places, 158/170 transitions.
Graph (complete) has 344 edges and 109 vertex of which 1 are kept as prefixes of interest. Removing 108 places using SCC suffix rule.0 ms
Discarding 108 places :
Also discarding 158 output transitions
Drop transitions (Output transitions of discarded places.) removed 158 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 1 /109 variables (removed 108) and now considering 0/158 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6734011177586070326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14251801974056025634.kers'
[2026-06-16 14:30:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6734011177586070326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14251801974056025634.kers]
[2026-06-16 14:30:47] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14251801974056025634.kers
Total runtime 0 ms.
[2026-06-16 14:30:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-06-16 14:30:47] [INFO ] Invariant cache hit.
[2026-06-16 14:30:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/109 places, 0/170 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44315 ms. Remains : 1/109 places, 0/170 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA FileSystem-PT-N02I10B08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 57180 ms.

BK_STOP 1781620247859

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

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