Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800032.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 gold2024
Input is FireWire-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 27K 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 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 86K 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-02-UpperBounds-00
FORMULA_NAME FireWire-PT-02-UpperBounds-01
FORMULA_NAME FireWire-PT-02-UpperBounds-02
FORMULA_NAME FireWire-PT-02-UpperBounds-03
FORMULA_NAME FireWire-PT-02-UpperBounds-04
FORMULA_NAME FireWire-PT-02-UpperBounds-05
FORMULA_NAME FireWire-PT-02-UpperBounds-06
FORMULA_NAME FireWire-PT-02-UpperBounds-07
FORMULA_NAME FireWire-PT-02-UpperBounds-08
FORMULA_NAME FireWire-PT-02-UpperBounds-09
FORMULA_NAME FireWire-PT-02-UpperBounds-10
FORMULA_NAME FireWire-PT-02-UpperBounds-11
FORMULA_NAME FireWire-PT-02-UpperBounds-12
FORMULA_NAME FireWire-PT-02-UpperBounds-13
FORMULA_NAME FireWire-PT-02-UpperBounds-14
FORMULA_NAME FireWire-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748675505243

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:11:47] [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-05-31 07:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:11:48] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-31 07:11:48] [INFO ] Transformed 108 places.
[2025-05-31 07:11:48] [INFO ] Transformed 355 transitions.
[2025-05-31 07:11:48] [INFO ] Found NUPN structural information;
[2025-05-31 07:11:48] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 34 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 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-05-31 07:11:48] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
// Phase 1: matrix 269 rows 108 cols
[2025-05-31 07:11:48] [INFO ] Computed 8 invariants in 25 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 (553 resets) in 92 ms. (107 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (934 resets) in 116 ms. (512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 07:11:48] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
[2025-05-31 07:11:48] [INFO ] Invariant cache hit.
[2025-05-31 07:11:49] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2025-05-31 07:11:49] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-31 07:11:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:11:49] [INFO ] [Real]Added 40 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:11:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:49] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-31 07:11:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 38 ms returned sat
[2025-05-31 07:11:49] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 81 ms.
[2025-05-31 07:11:50] [INFO ] Added : 17 causal constraints over 4 iterations in 229 ms. Result :sat
Minimization took 90 ms.
[2025-05-31 07:11:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:11:50] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 07:11:50] [INFO ] [Real]Added 40 Read/Feed constraints in 15 ms returned sat
[2025-05-31 07:11:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:50] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-31 07:11:50] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2025-05-31 07:11:50] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 49 ms.
[2025-05-31 07:11:51] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 23 ms to minimize.
[2025-05-31 07:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-05-31 07:11:51] [INFO ] Added : 19 causal constraints over 5 iterations in 421 ms. Result :sat
Minimization took 83 ms.
[2025-05-31 07:11:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:51] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-31 07:11:51] [INFO ] [Real]Added 40 Read/Feed constraints in 18 ms returned sat
[2025-05-31 07:11:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:51] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:11:51] [INFO ] [Nat]Added 40 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:11:51] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 42 ms.
[2025-05-31 07:11:51] [INFO ] Added : 21 causal constraints over 5 iterations in 169 ms. Result :sat
Minimization took 96 ms.
[2025-05-31 07:11:52] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:11:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
[2025-05-31 07:11:52] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 37 ms.
[2025-05-31 07:11:52] [INFO ] Added : 15 causal constraints over 4 iterations in 149 ms. Result :sat
Minimization took 94 ms.
[2025-05-31 07:11:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-05-31 07:11:52] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:11:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2025-05-31 07:11:53] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 58 ms.
[2025-05-31 07:11:53] [INFO ] Added : 18 causal constraints over 4 iterations in 175 ms. Result :sat
Minimization took 85 ms.
[2025-05-31 07:11:53] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Real]Added 40 Read/Feed constraints in 13 ms returned sat
[2025-05-31 07:11:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-31 07:11:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 28 ms returned sat
[2025-05-31 07:11:53] [INFO ] Computed and/alt/rep : 107/403/107 causal constraints (skipped 161 transitions) in 26 ms.
[2025-05-31 07:11:53] [INFO ] Added : 2 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 301/301 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 108 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 297
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 107 transition count 296
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 106 transition count 296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 101 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 101 transition count 284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 101 transition count 281
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 99 transition count 277
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 99 transition count 277
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 96 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 96 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 45 place count 96 transition count 268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 96 transition count 270
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 49 place count 95 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 95 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 94 transition count 265
Applied a total of 52 rules in 211 ms. Remains 94 /108 variables (removed 14) and now considering 265/301 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 94/108 places, 265/301 transitions.
[2025-05-31 07:11:54] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 94 cols
[2025-05-31 07:11:54] [INFO ] Computed 8 invariants in 8 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 (64189 resets) in 1551 ms. (644 steps per ms)
FORMULA FireWire-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (32635 resets) in 1049 ms. (1904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:11:57] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2025-05-31 07:11:57] [INFO ] Invariant cache hit.
[2025-05-31 07:11:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 07:11:57] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-31 07:11:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 07:11:57] [INFO ] [Real]Added 38 Read/Feed constraints in 32 ms returned sat
[2025-05-31 07:11:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:11:57] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-31 07:11:57] [INFO ] [Nat]Added 38 Read/Feed constraints in 17 ms returned sat
[2025-05-31 07:11:57] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 24 ms.
[2025-05-31 07:11:57] [INFO ] Added : 12 causal constraints over 4 iterations in 116 ms. Result :sat
Minimization took 97 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 94 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p41) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 94 /94 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 94/94 places, 262/262 transitions.
[2025-05-31 07:11:57] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
// Phase 1: matrix 233 rows 94 cols
[2025-05-31 07:11:57] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64352 resets) in 1388 ms. (719 steps per ms)
BEST_FIRST walk for 1000001 steps (16259 resets) in 526 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:11:59] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:11:59] [INFO ] Invariant cache hit.
[2025-05-31 07:11:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 07:11:59] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-31 07:11:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 07:11:59] [INFO ] [Real]Added 37 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:11:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:11:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 07:11:59] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 07:11:59] [INFO ] [Nat]Added 37 Read/Feed constraints in 21 ms returned sat
[2025-05-31 07:12:00] [INFO ] Computed and/alt/rep : 103/414/103 causal constraints (skipped 128 transitions) in 39 ms.
[2025-05-31 07:12:00] [INFO ] Added : 43 causal constraints over 9 iterations in 262 ms. Result :sat
Minimization took 106 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 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 94/94 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-05-31 07:12:00] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:00] [INFO ] Invariant cache hit.
[2025-05-31 07:12:00] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-31 07:12:00] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:00] [INFO ] Invariant cache hit.
[2025-05-31 07:12:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 07:12:01] [INFO ] Implicit Places using invariants and state equation in 389 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 596 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 625 ms. Remains : 93/94 places, 262/262 transitions.
[2025-05-31 07:12:01] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
// Phase 1: matrix 233 rows 93 cols
[2025-05-31 07:12:01] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (64021 resets) in 1334 ms. (749 steps per ms)
BEST_FIRST walk for 1000001 steps (16072 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 07:12:02] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:02] [INFO ] Invariant cache hit.
[2025-05-31 07:12:02] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 07:12:03] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-05-31 07:12:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 07:12:03] [INFO ] [Real]Added 37 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:12:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:12:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-05-31 07:12:03] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-31 07:12:03] [INFO ] [Nat]Added 37 Read/Feed constraints in 22 ms returned sat
[2025-05-31 07:12:03] [INFO ] Computed and/alt/rep : 103/414/103 causal constraints (skipped 128 transitions) in 22 ms.
[2025-05-31 07:12:03] [INFO ] Added : 45 causal constraints over 10 iterations in 243 ms. Result :sat
Minimization took 125 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 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 93/93 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-05-31 07:12:03] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:03] [INFO ] Invariant cache hit.
[2025-05-31 07:12:03] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-31 07:12:03] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:03] [INFO ] Invariant cache hit.
[2025-05-31 07:12:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 07:12:04] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2025-05-31 07:12:04] [INFO ] Redundant transitions in 14 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-31 07:12:04] [INFO ] Flow matrix only has 233 transitions (discarded 29 similar events)
[2025-05-31 07:12:04] [INFO ] Invariant cache hit.
[2025-05-31 07:12:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-31 07:12:06] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2025-05-31 07:12:07] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-31 07:12:09] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2025-05-31 07:12:09] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2025-05-31 07:12:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2025-05-31 07:12:10] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2025-05-31 07:12:10] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 3 ms to minimize.
[2025-05-31 07:12:10] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 233/325 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-31 07:12:15] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2025-05-31 07:12:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 147 constraints, problems are : Problem set: 0 solved, 260 unsolved in 20680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 233/325 variables, 92/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 260/406 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-31 07:12:40] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/326 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 408 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints]
After SMT, in 51189ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 51219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51682 ms. Remains : 93/93 places, 262/262 transitions.
RANDOM walk for 40000 steps (2547 resets) in 2084 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (680 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (671 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
[2025-05-31 07:12:56] [INFO ] Flatten gal took : 227 ms
Finished probabilistic random walk after 2018 steps, run visited all 2 properties in 78 ms. (steps per millisecond=25 )
Probabilistic random walk after 2018 steps, saw 1179 distinct states, run finished after 86 ms. (steps per millisecond=23 ) properties seen :2
[2025-05-31 07:12:56] [INFO ] Flatten gal took : 115 ms
[2025-05-31 07:12:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4746927632681321890.gal : 31 ms
[2025-05-31 07:12:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15131234852841326546.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4746927632681321890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15131234852841326546.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-02-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 68670 ms.

BK_STOP 1748675576679

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is FireWire-PT-02, 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 r097-smll-174860111800032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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