Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FireWire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 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 FireWire-PT-04-UpperBounds-00
FORMULA_NAME FireWire-PT-04-UpperBounds-01
FORMULA_NAME FireWire-PT-04-UpperBounds-02
FORMULA_NAME FireWire-PT-04-UpperBounds-03
FORMULA_NAME FireWire-PT-04-UpperBounds-04
FORMULA_NAME FireWire-PT-04-UpperBounds-05
FORMULA_NAME FireWire-PT-04-UpperBounds-06
FORMULA_NAME FireWire-PT-04-UpperBounds-07
FORMULA_NAME FireWire-PT-04-UpperBounds-08
FORMULA_NAME FireWire-PT-04-UpperBounds-09
FORMULA_NAME FireWire-PT-04-UpperBounds-10
FORMULA_NAME FireWire-PT-04-UpperBounds-11
FORMULA_NAME FireWire-PT-04-UpperBounds-12
FORMULA_NAME FireWire-PT-04-UpperBounds-13
FORMULA_NAME FireWire-PT-04-UpperBounds-14
FORMULA_NAME FireWire-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748847451240

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 06:57:33] [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]
[2025-06-02 06:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:57:34] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-06-02 06:57:34] [INFO ] Transformed 113 places.
[2025-06-02 06:57:34] [INFO ] Transformed 364 transitions.
[2025-06-02 06:57:34] [INFO ] Found NUPN structural information;
[2025-06-02 06:57:34] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 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, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 06:57:34] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2025-06-02 06:57:34] [INFO ] Computed 8 invariants in 34 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (501 resets) in 117 ms. (84 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (1142 resets) in 311 ms. (256 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 06:57:35] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
[2025-06-02 06:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:35] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-02 06:57:35] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-06-02 06:57:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:57:35] [INFO ] [Real]Added 40 Read/Feed constraints in 40 ms returned sat
[2025-06-02 06:57:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 06:57:36] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-06-02 06:57:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2025-06-02 06:57:36] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 113 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:37] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 46 ms to minimize.
[2025-06-02 06:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 06:57:37] [INFO ] Added : 51 causal constraints over 12 iterations in 842 ms. Result :sat
Minimization took 123 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:37] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-06-02 06:57:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 06:57:37] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-02 06:57:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 24 ms returned sat
[2025-06-02 06:57:37] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 66 ms.
[2025-06-02 06:57:38] [INFO ] Added : 32 causal constraints over 8 iterations in 380 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:38] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:38] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-06-02 06:57:38] [INFO ] [Real]Added 40 Read/Feed constraints in 19 ms returned sat
[2025-06-02 06:57:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-02 06:57:38] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-02 06:57:38] [INFO ] [Nat]Added 40 Read/Feed constraints in 19 ms returned sat
[2025-06-02 06:57:38] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 57 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:39] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 7 ms to minimize.
[2025-06-02 06:57:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2025-06-02 06:57:39] [INFO ] Added : 31 causal constraints over 7 iterations in 875 ms. Result :sat
Minimization took 104 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:39] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:40] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-02 06:57:40] [INFO ] [Real]Added 40 Read/Feed constraints in 16 ms returned sat
[2025-06-02 06:57:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 06:57:40] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-06-02 06:57:40] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-06-02 06:57:40] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 60 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
[2025-06-02 06:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-02 06:57:40] [INFO ] Added : 36 causal constraints over 8 iterations in 457 ms. Result :sat
Minimization took 105 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:40] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:41] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-02 06:57:41] [INFO ] [Real]Added 40 Read/Feed constraints in 12 ms returned sat
[2025-06-02 06:57:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 06:57:41] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-06-02 06:57:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2025-06-02 06:57:41] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 53 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:42] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 26 ms to minimize.
[2025-06-02 06:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2025-06-02 06:57:42] [INFO ] Added : 47 causal constraints over 10 iterations in 728 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:42] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-02 06:57:42] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-06-02 06:57:42] [INFO ] [Real]Added 40 Read/Feed constraints in 25 ms returned sat
[2025-06-02 06:57:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-02 06:57:42] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-02 06:57:42] [INFO ] [Nat]Added 40 Read/Feed constraints in 36 ms returned sat
[2025-06-02 06:57:42] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
[2025-06-02 06:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-02 06:57:43] [INFO ] Added : 26 causal constraints over 7 iterations in 439 ms. Result :sat
Minimization took 94 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:43] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:43] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 06:57:43] [INFO ] [Real]Added 40 Read/Feed constraints in 25 ms returned sat
[2025-06-02 06:57:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 06:57:43] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-06-02 06:57:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 32 ms returned sat
[2025-06-02 06:57:43] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 42 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:44] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
[2025-06-02 06:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-06-02 06:57:44] [INFO ] Added : 14 causal constraints over 6 iterations in 436 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:44] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-02 06:57:44] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 06:57:44] [INFO ] [Real]Added 40 Read/Feed constraints in 22 ms returned sat
[2025-06-02 06:57:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 06:57:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 06:57:44] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-02 06:57:44] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
[2025-06-02 06:57:44] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:57:45] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 6 ms to minimize.
[2025-06-02 06:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-02 06:57:45] [INFO ] Added : 33 causal constraints over 8 iterations in 486 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 1] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 112 transition count 303
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 111 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 110 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 110 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 107 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 107 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 107 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 107 transition count 296
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 37 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 104 transition count 290
Applied a total of 40 rules in 253 ms. Remains 104 /113 variables (removed 9) and now considering 290/308 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 104/113 places, 290/308 transitions.
[2025-06-02 06:57:46] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 104 cols
[2025-06-02 06:57:46] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (64134 resets) in 1942 ms. (514 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16263 resets) in 499 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 06:57:48] [INFO ] Flatten gal took : 83 ms
[2025-06-02 06:57:48] [INFO ] Flatten gal took : 34 ms
[2025-06-02 06:57:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8010554376392960046.gal : 33 ms
[2025-06-02 06:57:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15758125453842437698.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8010554376392960046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15758125453842437698.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15149 ms.

BK_STOP 1748847469170

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FireWire-PT-04"
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-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-04, 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 r086-smll-174860102200269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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