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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.6K 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 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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-d0m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106385216

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-d0m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:53:06] [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:53:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:53:06] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-05 06:53:06] [INFO ] Transformed 262 places.
[2025-06-05 06:53:06] [INFO ] Transformed 73 transitions.
[2025-06-05 06:53:06] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-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:53:06] [INFO ] Computed 6 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 73, 1, 1, 1]
RANDOM walk for 10000 steps (2262 resets) in 34 ms. (285 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (3056 resets) in 40 ms. (731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[73, 1, 1]
[2025-06-05 06:53:06] [INFO ] Invariant cache hit.
[2025-06-05 06:53:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:06] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:53:06] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-05 06:53:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:53:07] [INFO ] [Real]Added 31 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:53:07] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 9 ms.
[2025-06-05 06:53:07] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 60 ms.
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Added 31 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 9 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2025-06-05 06:53:07] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2025-06-05 06:53:07] [INFO ] Added : 12 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 26 ms.
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Added 31 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-05 06:53:07] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 9 ms.
[2025-06-05 06:53:07] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[73, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[73, 1, 1]
Support contains 3 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.2 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 33 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 43 ms. Remains : 60/72 places, 61/73 transitions.
// Phase 1: matrix 61 rows 60 cols
[2025-06-05 06:53:07] [INFO ] Computed 4 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[36, 1, 1]
RANDOM walk for 1000000 steps (224063 resets) in 674 ms. (1481 steps per ms)
BEST_FIRST walk for 3000002 steps (309087 resets) in 962 ms. (3115 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[36, 1, 1]
[2025-06-05 06:53:09] [INFO ] Invariant cache hit.
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:53:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:53:09] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2025-06-05 06:53:09] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 45 transitions) in 5 ms.
[2025-06-05 06:53:09] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 23 ms.
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:09] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 45 transitions) in 9 ms.
[2025-06-05 06:53:09] [INFO ] Added : 10 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 17 ms.
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:09] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:09] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 45 transitions) in 6 ms.
[2025-06-05 06:53:09] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[36, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[36, 1, 1]
Support contains 3 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 4 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 4 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 4 ms. Remains 60 /60 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 06:53:10] [INFO ] Invariant cache hit.
[2025-06-05 06:53:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 06:53:10] [INFO ] Invariant cache hit.
[2025-06-05 06:53:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:53:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2025-06-05 06:53:10] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 06:53:10] [INFO ] Invariant cache hit.
[2025-06-05 06:53:10] [INFO ] State equation strengthened by 25 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, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 2/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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 89 constraints, problems are : Problem set: 0 solved, 60 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 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, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 2/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, 25/89 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 60/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2558ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2565ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2705 ms. Remains : 60/60 places, 61/61 transitions.
RANDOM walk for 40000 steps (8984 resets) in 1049 ms. (38 steps per ms) remains 6/6 properties
[2025-06-05 06:53:13] [INFO ] Flatten gal took : 48 ms
[2025-06-05 06:53:13] [INFO ] Flatten gal took : 10 ms
BEST_FIRST walk for 40001 steps (4145 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
[2025-06-05 06:53:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2163769099564128925.gal : 20 ms
BEST_FIRST walk for 40002 steps (4167 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4104 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
[2025-06-05 06:53:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18404361885772301493.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2163769099564128925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18404361885772301493.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (4148 resets) in 117 ms. (339 steps per ms) remains 6/6 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 ...329
Loading property file /tmp/ReachabilityCardinality18404361885772301493.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40001 steps (4060 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :38 after 137
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :137 after 213
BEST_FIRST walk for 40002 steps (4031 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :213 after 474
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :474 after 1109
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1109 after 2348
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2348 after 7393
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7393 after 24571
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :24571 after 88633
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :88633 after 371677
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :371677 after 1.30225e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.30225e+06 after 5.0593e+06
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.0593e+06 after 1.43122e+07
Interrupted probabilistic random walk after 3527542 steps, run timeout after 3001 ms. (steps per millisecond=1175 ) properties seen :5 out of 6
Probabilistic random walk after 3527542 steps, saw 1532225 distinct states, run finished after 3004 ms. (steps per millisecond=1174 ) properties seen :5
[2025-06-05 06:53:16] [INFO ] Invariant cache hit.
[2025-06-05 06:53:16] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/42 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/88 variables, 42/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/107 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:53:16] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 107/121 variables, and 77 constraints, problems are : Problem set: 1 solved, 0 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/60 constraints, ReadFeed: 18/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 184ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[36]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[36]
[2025-06-05 06:53:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 10000 steps (2246 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1020 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 06:53:16] [INFO ] Invariant cache hit.
[2025-06-05 06:53:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:53:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 06:53:16] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2025-06-05 06:53:16] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 45 transitions) in 5 ms.
[2025-06-05 06:53:16] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 61/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 60
Applied a total of 2 rules in 12 ms. Remains 59 /60 variables (removed 1) and now considering 60/61 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 59/60 places, 60/61 transitions.
// Phase 1: matrix 60 rows 59 cols
[2025-06-05 06:53:16] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 1000000 steps (223672 resets) in 567 ms. (1760 steps per ms)
BEST_FIRST walk for 1000000 steps (103116 resets) in 299 ms. (3333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 06:53:17] [INFO ] Invariant cache hit.
[2025-06-05 06:53:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:53:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:53:17] [INFO ] [Real]Added 24 Read/Feed constraints in 10 ms returned sat
[2025-06-05 06:53:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-05 06:53:17] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2025-06-05 06:53:17] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 44 transitions) in 5 ms.
[2025-06-05 06:53:17] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-06-05 06:53:17] [INFO ] Invariant cache hit.
[2025-06-05 06:53:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 06:53:17] [INFO ] Invariant cache hit.
[2025-06-05 06:53:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-05 06:53:18] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2025-06-05 06:53:18] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-05 06:53:18] [INFO ] Invariant cache hit.
[2025-06-05 06:53:18] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 87 constraints, problems are : Problem set: 0 solved, 59 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 146 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 2325ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2326ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2475 ms. Remains : 59/59 places, 60/60 transitions.
[2025-06-05 06:53:20] [INFO ] Flatten gal took : 18 ms
[2025-06-05 06:53:20] [INFO ] Flatten gal took : 10 ms
[2025-06-05 06:53:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2578447406308214386.gal : 2 ms
[2025-06-05 06:53:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16048134244088995914.prop : 0 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/ReachabilityCardinality2578447406308214386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16048134244088995914.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8999 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4014 resets) in 27 ms. (1428 steps per ms) remains 2/2 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 ...329
Loading property file /tmp/ReachabilityCardinality16048134244088995914.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 137
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :137 after 213
BEST_FIRST walk for 40002 steps (4075 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :213 after 529
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :529 after 1499
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1499 after 4501
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4501 after 16605
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :16605 after 60189
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :60189 after 599229
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :599229 after 1.49111e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.49111e+07 after 2.20585e+07
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.20585e+07 after 5.8569e+08
Interrupted probabilistic random walk after 3110056 steps, run timeout after 3001 ms. (steps per millisecond=1036 ) properties seen :1 out of 2
Probabilistic random walk after 3110056 steps, saw 1390106 distinct states, run finished after 3016 ms. (steps per millisecond=1031 ) properties seen :1
[2025-06-05 06:53:23] [INFO ] Invariant cache hit.
[2025-06-05 06:53:23] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 45/86 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/105 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 105/119 variables, and 74 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/59 constraints, ReadFeed: 17/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 120ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[36]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 in 6956 ms.
[2025-06-05 06:53:23] [INFO ] Flatten gal took : 7 ms
[2025-06-05 06:53:23] [INFO ] Applying decomposition
[2025-06-05 06:53:23] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4677122673668445273.txt' '-o' '/tmp/graph4677122673668445273.bin' '-w' '/tmp/graph4677122673668445273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4677122673668445273.bin' '-l' '-1' '-v' '-w' '/tmp/graph4677122673668445273.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:53:23] [INFO ] Decomposing Gal with order
[2025-06-05 06:53:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:53:23] [INFO ] Removed a total of 57 redundant transitions.
[2025-06-05 06:53:23] [INFO ] Flatten gal took : 41 ms
[2025-06-05 06:53:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 6 ms.
[2025-06-05 06:53:23] [INFO ] Time to serialize gal into /tmp/UpperBounds6937785828442970600.gal : 2 ms
[2025-06-05 06:53:23] [INFO ] Time to serialize properties into /tmp/UpperBounds12724341626612377243.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/UpperBounds6937785828442970600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12724341626612377243.prop' '--nowitness'

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 ...284
Loading property file /tmp/UpperBounds12724341626612377243.prop.
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\_mod\_flat,1.9464e+10,654.739,2244876,8590,764,1.01513e+06,98857,213,2.07853e+07,53,313578,0
Total reachable state count : 19464022269

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 :0 <= i5.u8.l204 <= 32
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 32 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d0m36-UpperBounds-07,0,683.559,2244876,1,0,1.01513e+06,192586,307,2.07853e+07,97,791561,11961
Total runtime 701767 ms.

BK_STOP 1749107088266

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

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