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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.6K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 4.0K 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 450K 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-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106450237

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-d1m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:54:11] [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:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:54:11] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-06-05 06:54:11] [INFO ] Transformed 1295 places.
[2025-06-05 06:54:11] [INFO ] Transformed 749 transitions.
[2025-06-05 06:54:11] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2025-06-05 06:54:11] [INFO ] Computed 6 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[91, 10]
RANDOM walk for 10000 steps (2189 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 20001 steps (1971 resets) in 101 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[91, 10]
[2025-06-05 06:54:12] [INFO ] Invariant cache hit.
[2025-06-05 06:54:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-05 06:54:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 12 ms returned sat
[2025-06-05 06:54:12] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-06-05 06:54:12] [INFO ] State equation strengthened by 587 read => feed constraints.
[2025-06-05 06:54:12] [INFO ] [Real]Added 587 Read/Feed constraints in 105 ms returned sat
[2025-06-05 06:54:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:54:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:12] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-06-05 06:54:12] [INFO ] [Nat]Added 587 Read/Feed constraints in 118 ms returned sat
[2025-06-05 06:54:13] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 115 ms.
[2025-06-05 06:54:13] [INFO ] Added : 10 causal constraints over 2 iterations in 283 ms. Result :sat
Minimization took 581 ms.
[2025-06-05 06:54:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:54:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:14] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-06-05 06:54:14] [INFO ] [Real]Added 587 Read/Feed constraints in 77 ms returned sat
[2025-06-05 06:54:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:54:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:14] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-05 06:54:14] [INFO ] [Nat]Added 587 Read/Feed constraints in 109 ms returned sat
[2025-06-05 06:54:14] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 17 ms to minimize.
[2025-06-05 06:54:14] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2025-06-05 06:54:14] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:54:14] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:54:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 463 ms
[2025-06-05 06:54:14] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 74 ms.
[2025-06-05 06:54:15] [INFO ] Added : 14 causal constraints over 3 iterations in 267 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[91, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[91, 10]
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 226 transitions.
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 242 transition count 523
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 287 place count 182 transition count 233
Iterating global reduction 1 with 60 rules applied. Total rules applied 347 place count 182 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 352 place count 182 transition count 228
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 397 place count 137 transition count 183
Iterating global reduction 2 with 45 rules applied. Total rules applied 442 place count 137 transition count 183
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 458 place count 137 transition count 167
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 485 place count 110 transition count 138
Iterating global reduction 3 with 27 rules applied. Total rules applied 512 place count 110 transition count 138
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 529 place count 110 transition count 121
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 537 place count 102 transition count 110
Iterating global reduction 4 with 8 rules applied. Total rules applied 545 place count 102 transition count 110
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 553 place count 94 transition count 102
Iterating global reduction 4 with 8 rules applied. Total rules applied 561 place count 94 transition count 102
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 566 place count 89 transition count 96
Iterating global reduction 4 with 5 rules applied. Total rules applied 571 place count 89 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 573 place count 89 transition count 94
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 578 place count 84 transition count 89
Iterating global reduction 5 with 5 rules applied. Total rules applied 583 place count 84 transition count 89
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 586 place count 81 transition count 86
Iterating global reduction 5 with 3 rules applied. Total rules applied 589 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 590 place count 80 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 592 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 594 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 78 transition count 82
Applied a total of 595 rules in 91 ms. Remains 78 /259 variables (removed 181) and now considering 82/749 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 78/259 places, 82/749 transitions.
// Phase 1: matrix 82 rows 78 cols
[2025-06-05 06:54:15] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[64, 10]
RANDOM walk for 1000000 steps (224287 resets) in 741 ms. (1347 steps per ms)
BEST_FIRST walk for 2000002 steps (206752 resets) in 748 ms. (2670 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[64, 10]
[2025-06-05 06:54:17] [INFO ] Invariant cache hit.
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 06:54:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 06:54:17] [INFO ] [Real]Added 33 Read/Feed constraints in 13 ms returned sat
[2025-06-05 06:54:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:17] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 61 transitions) in 5 ms.
[2025-06-05 06:54:17] [INFO ] Added : 13 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 90 ms.
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 16 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:17] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 61 transitions) in 5 ms.
[2025-06-05 06:54:17] [INFO ] Added : 15 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[64, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 10]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 06:54:17] [INFO ] Invariant cache hit.
[2025-06-05 06:54:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 06:54:17] [INFO ] Invariant cache hit.
[2025-06-05 06:54:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 06:54:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2025-06-05 06:54:17] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-05 06:54:17] [INFO ] Invariant cache hit.
[2025-06-05 06:54:17] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/159 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 33/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 115 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/159 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 33/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 73/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 196 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3907 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 5819ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5826ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5995 ms. Remains : 78/78 places, 82/82 transitions.
RANDOM walk for 40000 steps (8945 resets) in 701 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4074 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
[2025-06-05 06:54:24] [INFO ] Flatten gal took : 59 ms
[2025-06-05 06:54:24] [INFO ] Flatten gal took : 25 ms
[2025-06-05 06:54:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15228021452670329450.gal : 6 ms
BEST_FIRST walk for 40002 steps (4187 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4124 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4041 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2025-06-05 06:54:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9445576255662584042.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/ReachabilityCardinality15228021452670329450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9445576255662584042.prop' '--nowitness' '--gen-order' 'FOLLOW'

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/ReachabilityCardinality9445576255662584042.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :38 after 157
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :157 after 385
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :385 after 1077
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1077 after 3783
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3783 after 4503
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4503 after 8133
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8133 after 46785
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :46785 after 325621
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :325621 after 2.82819e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.82819e+06 after 3.61103e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.61103e+07 after 5.62461e+08
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.62461e+08 after 9.34799e+09
Interrupted probabilistic random walk after 1073851 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :2 out of 4
Probabilistic random walk after 1073851 steps, saw 505956 distinct states, run finished after 3004 ms. (steps per millisecond=357 ) properties seen :2
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 61/115 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 34/149 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 31/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-05 06:54:27] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 160/160 variables, and 114 constraints, problems are : Problem set: 2 solved, 0 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 31/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 178ms problems are : Problem set: 2 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, 0] Max Struct:[64, 10]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2261 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (1029 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 06:54:27] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:27] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 61 transitions) in 5 ms.
[2025-06-05 06:54:27] [INFO ] Added : 13 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Graph (complete) has 215 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 81
Applied a total of 2 rules in 5 ms. Remains 77 /78 variables (removed 1) and now considering 81/82 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 77/78 places, 81/82 transitions.
// Phase 1: matrix 81 rows 77 cols
[2025-06-05 06:54:27] [INFO ] Computed 4 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (224289 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000000 steps (103411 resets) in 350 ms. (2849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2025-06-05 06:54:28] [INFO ] Invariant cache hit.
[2025-06-05 06:54:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 06:54:28] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:28] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 60 transitions) in 4 ms.
[2025-06-05 06:54:28] [INFO ] Added : 10 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 77/77 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-05 06:54:28] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 06:54:29] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-05 06:54:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2025-06-05 06:54:29] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-05 06:54:29] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 113 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/158 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 80/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 193 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3798ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3976 ms. Remains : 77/77 places, 81/81 transitions.
[2025-06-05 06:54:32] [INFO ] Flatten gal took : 11 ms
[2025-06-05 06:54:32] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 40000 steps (9031 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
[2025-06-05 06:54:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3544339366597378380.gal : 2 ms
[2025-06-05 06:54:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6447733900747447504.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/ReachabilityCardinality3544339366597378380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6447733900747447504.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
Loading property file /tmp/ReachabilityCardinality6447733900747447504.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 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 385
BEST_FIRST walk for 40002 steps (4266 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :385 after 1257
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1257 after 3783
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3783 after 4503
BEST_FIRST walk for 40003 steps (4166 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4503 after 8409
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8409 after 46785
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :46785 after 327301
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :327301 after 2.81199e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.81199e+06 after 3.49422e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.49422e+07 after 4.79668e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.79668e+08 after 8.8983e+09
Interrupted probabilistic random walk after 3303576 steps, run timeout after 3001 ms. (steps per millisecond=1100 ) properties seen :1 out of 2
Probabilistic random walk after 3303576 steps, saw 1533050 distinct states, run finished after 3001 ms. (steps per millisecond=1100 ) properties seen :1
[2025-06-05 06:54:36] [INFO ] Invariant cache hit.
[2025-06-05 06:54:36] [INFO ] State equation strengthened by 32 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) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/113 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/139 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/158 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:54:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/158 variables, and 114 constraints, problems are : Problem set: 1 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 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:[64]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 in 8730 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 82 rows 78 cols
[2025-06-05 06:54:36] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2219 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (1070 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-06-05 06:54:36] [INFO ] Invariant cache hit.
[2025-06-05 06:54:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-05 06:54:36] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 06:54:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:54:36] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 61 transitions) in 3 ms.
[2025-06-05 06:54:36] [INFO ] Added : 15 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 77 transition count 80
Applied a total of 3 rules in 6 ms. Remains 77 /78 variables (removed 1) and now considering 80/82 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 77/78 places, 80/82 transitions.
// Phase 1: matrix 80 rows 77 cols
[2025-06-05 06:54:36] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 1000000 steps (224491 resets) in 653 ms. (1529 steps per ms)
BEST_FIRST walk for 1000000 steps (103802 resets) in 356 ms. (2801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[10]
[2025-06-05 06:54:37] [INFO ] Invariant cache hit.
[2025-06-05 06:54:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:54:37] [INFO ] [Real]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 06:54:37] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:37] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 59 transitions) in 4 ms.
[2025-06-05 06:54:37] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[10]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 77/77 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-05 06:54:37] [INFO ] Invariant cache hit.
[2025-06-05 06:54:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 06:54:37] [INFO ] Invariant cache hit.
[2025-06-05 06:54:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:54:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2025-06-05 06:54:37] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-05 06:54:37] [INFO ] Invariant cache hit.
[2025-06-05 06:54:37] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/156 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 31/111 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 112 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/156 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 31/111 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 71/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/157 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 191 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4004 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 5832ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5975 ms. Remains : 77/77 places, 80/80 transitions.
[2025-06-05 06:54:43] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 40000 steps (8949 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-06-05 06:54:43] [INFO ] Flatten gal took : 7 ms
[2025-06-05 06:54:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14475878786761535124.gal : 6 ms
[2025-06-05 06:54:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2009450695111221621.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/ReachabilityCardinality14475878786761535124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2009450695111221621.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (4072 resets) in 25 ms. (1538 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/ReachabilityCardinality2009450695111221621.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 157
BEST_FIRST walk for 40001 steps (4117 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 229
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :229 after 1257
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1257 after 3411
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3411 after 5775
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5775 after 34935
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :34935 after 192711
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :192711 after 1.37297e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.37297e+06 after 1.48887e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.48887e+07 after 1.83479e+08
Interrupted probabilistic random walk after 3353741 steps, run timeout after 3001 ms. (steps per millisecond=1117 ) properties seen :1 out of 2
Probabilistic random walk after 3353741 steps, saw 1558299 distinct states, run finished after 3001 ms. (steps per millisecond=1117 ) properties seen :1
[2025-06-05 06:54:46] [INFO ] Invariant cache hit.
[2025-06-05 06:54:46] [INFO ] State equation strengthened by 31 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/70 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/152 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 21/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/157 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 157/157 variables, and 107 constraints, problems are : Problem set: 1 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms 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:[10]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 in 10535 ms.
[2025-06-05 06:54:46] [INFO ] Flatten gal took : 18 ms
[2025-06-05 06:54:46] [INFO ] Applying decomposition
[2025-06-05 06:54:46] [INFO ] Flatten gal took : 6 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/graph13323734385832614968.txt' '-o' '/tmp/graph13323734385832614968.bin' '-w' '/tmp/graph13323734385832614968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13323734385832614968.bin' '-l' '-1' '-v' '-w' '/tmp/graph13323734385832614968.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:54:46] [INFO ] Decomposing Gal with order
[2025-06-05 06:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:54:46] [INFO ] Removed a total of 75 redundant transitions.
[2025-06-05 06:54:46] [INFO ] Flatten gal took : 32 ms
[2025-06-05 06:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 7 ms.
[2025-06-05 06:54:46] [INFO ] Time to serialize gal into /tmp/UpperBounds15043949014195822281.gal : 3 ms
[2025-06-05 06:54:46] [INFO ] Time to serialize properties into /tmp/UpperBounds17658918697566243105.prop : 10 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/UpperBounds15043949014195822281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17658918697566243105.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 ...285
Loading property file /tmp/UpperBounds17658918697566243105.prop.
Detected timeout of ITS tools.
[2025-06-05 07:14:58] [INFO ] Flatten gal took : 5 ms
[2025-06-05 07:14:58] [INFO ] Time to serialize gal into /tmp/UpperBounds14652270681930859915.gal : 2 ms
[2025-06-05 07:14:58] [INFO ] Time to serialize properties into /tmp/UpperBounds12192325228929809186.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/UpperBounds14652270681930859915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12192325228929809186.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...306
Loading property file /tmp/UpperBounds12192325228929809186.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,5.50648e+15,165.653,2533316,2,42961,5,1.46183e+07,6,0,393,1.39989e+07,0
Total reachable state count : 5506483303191783

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 61
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 :0 <= l1206 <= 61
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 61 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

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-d1m64-UpperBounds-03,0,165.679,2533316,1,0,7,1.46183e+07,9,1,590,1.39989e+07,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 :0 <= l1056 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

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-d1m64-UpperBounds-05,0,165.683,2533316,1,0,8,1.46183e+07,10,1,595,1.39989e+07,5
Total runtime 1412463 ms.

BK_STOP 1749107863945

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

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