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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K 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 57K 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-d0m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106365104

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:52:46] [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:52:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:46] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-06-05 06:52:46] [INFO ] Transformed 262 places.
[2025-06-05 06:52:46] [INFO ] Transformed 73 transitions.
[2025-06-05 06:52:46] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2025-06-05 06:52:46] [INFO ] Computed 6 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 41, 7, 1, 7]
RANDOM walk for 10000 steps (2231 resets) in 31 ms. (312 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (3129 resets) in 39 ms. (750 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0] Max Struct:[41, 7, 7]
[2025-06-05 06:52:46] [INFO ] Invariant cache hit.
[2025-06-05 06:52:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:52:46] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:52:46] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-05 06:52:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:52:46] [INFO ] [Real]Added 31 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:52:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:52:46] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:52:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 06:52:46] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:52:47] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 11 ms.
[2025-06-05 06:52:47] [INFO ] Added : 10 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 33 ms.
[2025-06-05 06:52:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2025-06-05 06:52:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Real]Added 31 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:52:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:52:47] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 9 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2025-06-05 06:52:47] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2025-06-05 06:52:47] [INFO ] Added : 13 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0] Max Struct:[41, 1, 7]
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[41, 7]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 62 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 62 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 61 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 60 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 61
Applied a total of 22 rules in 96 ms. Remains 60 /72 variables (removed 12) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 60/72 places, 61/73 transitions.
// Phase 1: matrix 61 rows 60 cols
[2025-06-05 06:52:47] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[4, 7]
RANDOM walk for 1000000 steps (223336 resets) in 620 ms. (1610 steps per ms)
BEST_FIRST walk for 2000002 steps (206330 resets) in 637 ms. (3134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[4, 7]
[2025-06-05 06:52:49] [INFO ] Invariant cache hit.
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-05 06:52:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:52:49] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:52:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:52:49] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 44 transitions) in 6 ms.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
[2025-06-05 06:52:49] [INFO ] Added : 14 causal constraints over 3 iterations in 190 ms. Result :sat
Minimization took 30 ms.
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:52:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2025-06-05 06:52:49] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 44 transitions) in 23 ms.
[2025-06-05 06:52:49] [INFO ] Added : 7 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[4, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[4, 7]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 60/60 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 06:52:49] [INFO ] Invariant cache hit.
[2025-06-05 06:52:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-05 06:52:49] [INFO ] Invariant cache hit.
[2025-06-05 06:52:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:52:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2025-06-05 06:52:49] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 06:52:49] [INFO ] Invariant cache hit.
[2025-06-05 06:52:49] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/121 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 88 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/121 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 60/148 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 6 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 6 solved, 54 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3015ms problems are : Problem set: 6 solved, 54 unsolved
Search for dead transitions found 6 dead transitions in 3029ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/60 places, 55/61 transitions.
Graph (complete) has 144 edges and 60 vertex of which 51 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 9 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 48 transition count 44
Reduce places removed 4 places and 4 transitions.
Graph (complete) has 107 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 11 rules in 4 ms. Remains 2 /60 variables (removed 58) and now considering 0/55 (removed 55) transitions.
[2025-06-05 06:52:52] [INFO ] Computed 0 invariants in 1 ms
[2025-06-05 06:52:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-05 06:52:52] [INFO ] Invariant cache hit.
[2025-06-05 06:52:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/60 places, 0/61 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3345 ms. Remains : 2/60 places, 0/61 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 6585 ms.

BK_STOP 1749106373037

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

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