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.r223-tall-174902009200057.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 SieveSingleMsgMbox-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K 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 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106469113

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:54:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 06:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:54:30] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-05 06:54:30] [INFO ] Transformed 2398 places.
[2025-06-05 06:54:30] [INFO ] Transformed 1954 transitions.
[2025-06-05 06:54:30] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 06:54:30] [INFO ] Computed 6 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 10000 steps (2174 resets) in 304 ms. (32 steps per ms)
BEST_FIRST walk for 30001 steps (2649 resets) in 163 ms. (182 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-05 06:54:31] [INFO ] Invariant cache hit.
[2025-06-05 06:54:31] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-05 06:54:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2025-06-05 06:54:32] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2025-06-05 06:54:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:32] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2025-06-05 06:54:32] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 06:54:33] [INFO ] [Nat]Added 1674 Read/Feed constraints in 504 ms returned sat
[2025-06-05 06:54:33] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 28 ms to minimize.
[2025-06-05 06:54:33] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 4 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2025-06-05 06:54:34] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 3 ms to minimize.
[2025-06-05 06:54:35] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 1822 ms
[2025-06-05 06:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:54:35] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-05 06:54:35] [INFO ] [Real]Added 1674 Read/Feed constraints in 318 ms returned sat
[2025-06-05 06:54:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:35] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Nat]Added 1674 Read/Feed constraints in 355 ms returned sat
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 3 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 3 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 3 ms to minimize.
[2025-06-05 06:54:37] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 4 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2025-06-05 06:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1735 ms
[2025-06-05 06:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:38] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-05 06:54:39] [INFO ] [Real]Added 1674 Read/Feed constraints in 301 ms returned sat
[2025-06-05 06:54:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:54:39] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-05 06:54:39] [INFO ] [Nat]Added 1674 Read/Feed constraints in 441 ms returned sat
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 2 ms to minimize.
[2025-06-05 06:54:40] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 3 ms to minimize.
[2025-06-05 06:54:41] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2025-06-05 06:54:41] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 3 ms to minimize.
[2025-06-05 06:54:41] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 3 ms to minimize.
[2025-06-05 06:54:42] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 3 ms to minimize.
[2025-06-05 06:54:42] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2025-06-05 06:54:42] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 2 ms to minimize.
[2025-06-05 06:54:43] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 3 ms to minimize.
[2025-06-05 06:54:43] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 3 ms to minimize.
[2025-06-05 06:54:44] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2025-06-05 06:54:44] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 4186 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 0, 1]
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1171 place count 177 transition count 270
Iterating global reduction 2 with 92 rules applied. Total rules applied 1263 place count 177 transition count 270
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1298 place count 177 transition count 235
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1337 place count 138 transition count 181
Iterating global reduction 3 with 39 rules applied. Total rules applied 1376 place count 138 transition count 181
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1400 place count 138 transition count 157
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1408 place count 130 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1416 place count 130 transition count 146
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1424 place count 122 transition count 138
Iterating global reduction 4 with 8 rules applied. Total rules applied 1432 place count 122 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1436 place count 118 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 1440 place count 118 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1442 place count 118 transition count 131
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1446 place count 114 transition count 127
Iterating global reduction 5 with 4 rules applied. Total rules applied 1450 place count 114 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1452 place count 112 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 1454 place count 112 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1455 place count 111 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1456 place count 111 transition count 124
Applied a total of 1456 rules in 117 ms. Remains 111 /414 variables (removed 303) and now considering 124/1954 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 111/414 places, 124/1954 transitions.
// Phase 1: matrix 124 rows 111 cols
[2025-06-05 06:54:44] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (224262 resets) in 960 ms. (1040 steps per ms)
BEST_FIRST walk for 2000000 steps (206231 resets) in 943 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-05 06:54:46] [INFO ] Invariant cache hit.
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-05 06:54:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 06:54:46] [INFO ] [Real]Added 47 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:54:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2025-06-05 06:54:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2025-06-05 06:54:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-06-05 06:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2025-06-05 06:54:46] [INFO ] Computed and/alt/rep : 30/79/30 causal constraints (skipped 93 transitions) in 14 ms.
[2025-06-05 06:54:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-06-05 06:54:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-06-05 06:54:46] [INFO ] Added : 19 causal constraints over 4 iterations in 145 ms. Result :sat
Minimization took 56 ms.
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Real]Added 47 Read/Feed constraints in 12 ms returned sat
[2025-06-05 06:54:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-05 06:54:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:54:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:54:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2025-06-05 06:54:47] [INFO ] Computed and/alt/rep : 30/79/30 causal constraints (skipped 93 transitions) in 13 ms.
[2025-06-05 06:54:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-06-05 06:54:47] [INFO ] Added : 20 causal constraints over 4 iterations in 159 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 111/111 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-05 06:54:47] [INFO ] Invariant cache hit.
[2025-06-05 06:54:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 06:54:47] [INFO ] Invariant cache hit.
[2025-06-05 06:54:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 06:54:47] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2025-06-05 06:54:47] [INFO ] Redundant transitions in 3 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-05 06:54:47] [INFO ] Invariant cache hit.
[2025-06-05 06:54:47] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-05 06:54:49] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:54:49] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:54:49] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/235 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 47/165 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2025-06-05 06:54:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/235 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/235 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 166 constraints, problems are : Problem set: 3 solved, 120 unsolved in 6465 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 4/111 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 124/235 variables, 111/119 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 47/166 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 120/286 constraints. Problems are: Problem set: 18 solved, 105 unsolved
[2025-06-05 06:54:57] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:54:57] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/288 constraints. Problems are: Problem set: 18 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/288 constraints. Problems are: Problem set: 18 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/288 constraints. Problems are: Problem set: 18 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 288 constraints, problems are : Problem set: 18 solved, 105 unsolved in 9776 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 6/6 constraints]
After SMT, in 16444ms problems are : Problem set: 18 solved, 105 unsolved
Search for dead transitions found 18 dead transitions in 16455ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 106/124 transitions.
Graph (complete) has 259 edges and 111 vertex of which 77 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Reduce places removed 7 places and 21 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 70 transition count 70
Reduce places removed 9 places and 11 transitions.
Graph (complete) has 151 edges and 61 vertex of which 2 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 59 output transitions
Drop transitions (Output transitions of discarded places.) removed 59 transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 33 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 33 rules in 5 ms. Remains 2 /111 variables (removed 109) and now considering 0/106 (removed 106) transitions.
[2025-06-05 06:55:04] [INFO ] Computed 0 invariants in 0 ms
[2025-06-05 06:55:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-05 06:55:04] [INFO ] Invariant cache hit.
[2025-06-05 06:55:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/111 places, 0/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16801 ms. Remains : 2/111 places, 0/124 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 33756 ms.

BK_STOP 1749106504231

--------------------
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="SieveSingleMsgMbox-PT-d2m04"
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 SieveSingleMsgMbox-PT-d2m04, 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 r223-tall-174902009200057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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