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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 97K 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-07-UpperBounds-00
FORMULA_NAME FireWire-PT-07-UpperBounds-01
FORMULA_NAME FireWire-PT-07-UpperBounds-02
FORMULA_NAME FireWire-PT-07-UpperBounds-03
FORMULA_NAME FireWire-PT-07-UpperBounds-04
FORMULA_NAME FireWire-PT-07-UpperBounds-05
FORMULA_NAME FireWire-PT-07-UpperBounds-06
FORMULA_NAME FireWire-PT-07-UpperBounds-07
FORMULA_NAME FireWire-PT-07-UpperBounds-08
FORMULA_NAME FireWire-PT-07-UpperBounds-09
FORMULA_NAME FireWire-PT-07-UpperBounds-10
FORMULA_NAME FireWire-PT-07-UpperBounds-11
FORMULA_NAME FireWire-PT-07-UpperBounds-12
FORMULA_NAME FireWire-PT-07-UpperBounds-13
FORMULA_NAME FireWire-PT-07-UpperBounds-14
FORMULA_NAME FireWire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748675860719

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 07:17:43] [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:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:17:44] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-31 07:17:44] [INFO ] Transformed 126 places.
[2025-05-31 07:17:44] [INFO ] Transformed 396 transitions.
[2025-05-31 07:17:44] [INFO ] Found NUPN structural information;
[2025-05-31 07:17:44] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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:17:44] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2025-05-31 07:17:44] [INFO ] Computed 8 invariants in 93 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 (551 resets) in 87 ms. (113 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (1004 resets) in 228 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 07:17:44] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2025-05-31 07:17:44] [INFO ] Invariant cache hit.
[2025-05-31 07:17:45] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-05-31 07:17:45] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2025-05-31 07:17:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:17:46] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-05-31 07:17:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 07:17:46] [INFO ] [Nat]Added 45 Read/Feed constraints in 101 ms returned sat
[2025-05-31 07:17:46] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 148 ms.
[2025-05-31 07:17:46] [INFO ] Added : 15 causal constraints over 4 iterations in 453 ms. Result :sat
Minimization took 184 ms.
[2025-05-31 07:17:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:17:47] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-31 07:17:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:17:47] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-05-31 07:17:47] [INFO ] [Nat]Added 45 Read/Feed constraints in 45 ms returned sat
[2025-05-31 07:17:47] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 67 ms.
[2025-05-31 07:17:48] [INFO ] Added : 21 causal constraints over 5 iterations in 243 ms. Result :sat
Minimization took 156 ms.
[2025-05-31 07:17:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:17:48] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-05-31 07:17:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:17:48] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 07:17:48] [INFO ] [Nat]Added 45 Read/Feed constraints in 94 ms returned sat
[2025-05-31 07:17:48] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 47 ms.
[2025-05-31 07:17:48] [INFO ] Added : 16 causal constraints over 5 iterations in 190 ms. Result :sat
Minimization took 118 ms.
[2025-05-31 07:17:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:17:49] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-05-31 07:17:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-31 07:17:49] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-31 07:17:49] [INFO ] [Nat]Added 45 Read/Feed constraints in 35 ms returned sat
[2025-05-31 07:17:49] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 50 ms.
[2025-05-31 07:17:49] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 18 ms to minimize.
[2025-05-31 07:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-05-31 07:17:49] [INFO ] Added : 36 causal constraints over 8 iterations in 440 ms. Result :sat
Minimization took 137 ms.
[2025-05-31 07:17:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:17:50] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:17:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:17:50] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-31 07:17:50] [INFO ] [Nat]Added 45 Read/Feed constraints in 73 ms returned sat
[2025-05-31 07:17:50] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 46 ms.
[2025-05-31 07:17:51] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 4 ms to minimize.
[2025-05-31 07:17:51] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-05-31 07:17:51] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2025-05-31 07:17:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2025-05-31 07:17:51] [INFO ] Added : 27 causal constraints over 8 iterations in 884 ms. Result :sat
Minimization took 151 ms.
[2025-05-31 07:17:51] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-31 07:17:51] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-05-31 07:17:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-31 07:17:52] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 07:17:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 135 ms returned sat
[2025-05-31 07:17:52] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2025-05-31 07:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-05-31 07:17:52] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 47 ms.
[2025-05-31 07:17:52] [INFO ] Added : 1 causal constraints over 1 iterations in 123 ms. Result :sat
Minimization took 156 ms.
[2025-05-31 07:17:52] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:17:53] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-05-31 07:17:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:17:53] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 07:17:53] [INFO ] [Nat]Added 45 Read/Feed constraints in 38 ms returned sat
[2025-05-31 07:17:53] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 52 ms.
[2025-05-31 07:17:53] [INFO ] Added : 40 causal constraints over 8 iterations in 371 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-07-UpperBounds-06 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 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 343/343 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 120 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 120 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 117 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 116 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 113 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 112 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 112 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 111 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 108 transition count 309
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 48 place count 108 transition count 303
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 57 place count 108 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 108 transition count 296
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 3 with 3 rules applied. Total rules applied 61 place count 107 transition count 294
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 63 place count 107 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 106 transition count 291
Applied a total of 64 rules in 210 ms. Remains 106 /126 variables (removed 20) and now considering 291/343 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 106/126 places, 291/343 transitions.
[2025-05-31 07:17:54] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 106 cols
[2025-05-31 07:17:54] [INFO ] Computed 8 invariants in 15 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 (57906 resets) in 1841 ms. (542 steps per ms)
BEST_FIRST walk for 4000003 steps (56736 resets) in 2403 ms. (1663 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 07:17:59] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2025-05-31 07:17:59] [INFO ] Invariant cache hit.
[2025-05-31 07:17:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:17:59] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-05-31 07:17:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:17:59] [INFO ] [Real]Added 40 Read/Feed constraints in 14 ms returned sat
[2025-05-31 07:17:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:17:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-31 07:17:59] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-31 07:17:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2025-05-31 07:17:59] [INFO ] Computed and/alt/rep : 120/486/120 causal constraints (skipped 140 transitions) in 23 ms.
[2025-05-31 07:18:00] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2025-05-31 07:18:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-05-31 07:18:00] [INFO ] Added : 58 causal constraints over 12 iterations in 617 ms. Result :sat
Minimization took 181 ms.
[2025-05-31 07:18:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:18:00] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-05-31 07:18:00] [INFO ] [Real]Added 40 Read/Feed constraints in 24 ms returned sat
[2025-05-31 07:18:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:18:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-31 07:18:00] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-31 07:18:00] [INFO ] [Nat]Added 40 Read/Feed constraints in 32 ms returned sat
[2025-05-31 07:18:00] [INFO ] Computed and/alt/rep : 120/486/120 causal constraints (skipped 140 transitions) in 36 ms.
[2025-05-31 07:18:01] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2025-05-31 07:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-05-31 07:18:01] [INFO ] Added : 61 causal constraints over 13 iterations in 675 ms. Result :sat
Minimization took 198 ms.
[2025-05-31 07:18:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-31 07:18:01] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-31 07:18:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:18:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:18:02] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 07:18:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 25 ms returned sat
[2025-05-31 07:18:02] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2025-05-31 07:18:02] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2025-05-31 07:18:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2025-05-31 07:18:02] [INFO ] Computed and/alt/rep : 120/486/120 causal constraints (skipped 140 transitions) in 34 ms.
[2025-05-31 07:18:02] [INFO ] Added : 15 causal constraints over 3 iterations in 240 ms. Result :sat
Minimization took 157 ms.
[2025-05-31 07:18:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-31 07:18:03] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 07:18:03] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-05-31 07:18:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:18:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 42 ms returned sat
[2025-05-31 07:18:03] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-05-31 07:18:03] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2025-05-31 07:18:03] [INFO ] Computed and/alt/rep : 120/486/120 causal constraints (skipped 140 transitions) in 62 ms.
[2025-05-31 07:18:04] [INFO ] Added : 38 causal constraints over 8 iterations in 498 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 291/291 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 106/106 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 291/291 transitions.
Applied a total of 0 rules in 27 ms. Remains 106 /106 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2025-05-31 07:18:04] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2025-05-31 07:18:04] [INFO ] Invariant cache hit.
[2025-05-31 07:18:04] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-05-31 07:18:04] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2025-05-31 07:18:04] [INFO ] Invariant cache hit.
[2025-05-31 07:18:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 07:18:05] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2025-05-31 07:18:05] [INFO ] Redundant transitions in 17 ms returned []
Running 289 sub problems to find dead transitions.
[2025-05-31 07:18:05] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2025-05-31 07:18:05] [INFO ] Invariant cache hit.
[2025-05-31 07:18:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2025-05-31 07:18:07] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2025-05-31 07:18:07] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2025-05-31 07:18:07] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2025-05-31 07:18:07] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2025-05-31 07:18:08] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2025-05-31 07:18:08] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2025-05-31 07:18:08] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2025-05-31 07:18:08] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2025-05-31 07:18:08] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-05-31 07:18:09] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2025-05-31 07:18:09] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2025-05-31 07:18:09] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 40/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 1/368 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 19886 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 40/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 29491 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints]
After SMT, in 49957ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50738 ms. Remains : 106/106 places, 291/291 transitions.
RANDOM walk for 40000 steps (2244 resets) in 2684 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (595 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (519 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (550 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
[2025-05-31 07:18:56] [INFO ] Flatten gal took : 384 ms
BEST_FIRST walk for 40002 steps (527 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (574 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
[2025-05-31 07:18:56] [INFO ] Flatten gal took : 220 ms
BEST_FIRST walk for 40002 steps (555 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (522 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
[2025-05-31 07:18:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15862294608625644621.gal : 99 ms
[2025-05-31 07:18:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17094221502507096968.prop : 2 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/ReachabilityCardinality15862294608625644621.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17094221502507096968.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (531 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
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 ...330
Loading property file /tmp/ReachabilityCardinality17094221502507096968.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :21 after 43
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :43 after 106
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :106 after 288
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :288 after 3672
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3672 after 13073
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :13073 after 90071
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :275730 after 782571
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.40325e+06,1.01214,18324,2,1810,18,55990,12,0,723,49895,0
Total reachable state count : 4403250

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,32,1.01305,18324,2,135,18,55990,13,0,726,49895,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,32,1.01349,18584,2,135,18,55990,14,0,727,49895,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6592,1.014,18584,2,477,18,55990,14,0,728,49895,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6592,1.01444,18584,2,477,18,55990,14,0,728,49895,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6592,1.01497,18584,2,477,18,55990,14,0,729,49895,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6592,1.01547,18584,2,477,18,55990,14,0,729,49895,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,9544,1.01586,18584,2,403,18,55990,14,0,730,49895,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,9544,1.01622,18584,2,403,18,55990,14,0,730,49895,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 639748 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :6 out of 8
Probabilistic random walk after 639748 steps, saw 142876 distinct states, run finished after 3006 ms. (steps per millisecond=212 ) properties seen :6
FORMULA FireWire-PT-07-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 76413 ms.

BK_STOP 1748675940075

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

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