About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d1m06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15688.860 | 26467.00 | 45766.00 | 111.10 | 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 | normal |
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-174902009200052.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-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 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-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749106414219
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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:53:35] [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:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:53:35] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-05 06:53:35] [INFO ] Transformed 1295 places.
[2025-06-05 06:53:35] [INFO ] Transformed 749 transitions.
[2025-06-05 06:53:35] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2025-06-05 06:53:35] [INFO ] Computed 6 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[29, 1, 1]
RANDOM walk for 10000 steps (2158 resets) in 152 ms. (65 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (2004 resets) in 112 ms. (177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[29, 1]
[2025-06-05 06:53:36] [INFO ] Invariant cache hit.
[2025-06-05 06:53:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-05 06:53:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2025-06-05 06:53:36] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-06-05 06:53:36] [INFO ] State equation strengthened by 587 read => feed constraints.
[2025-06-05 06:53:36] [INFO ] [Real]Added 587 Read/Feed constraints in 105 ms returned sat
[2025-06-05 06:53:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:36] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-06-05 06:53:36] [INFO ] [Nat]Added 587 Read/Feed constraints in 103 ms returned sat
[2025-06-05 06:53:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 118 ms.
[2025-06-05 06:53:37] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 21 ms to minimize.
[2025-06-05 06:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2025-06-05 06:53:37] [INFO ] Added : 15 causal constraints over 5 iterations in 700 ms. Result :sat
Minimization took 578 ms.
[2025-06-05 06:53:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Real]Added 587 Read/Feed constraints in 81 ms returned sat
[2025-06-05 06:53:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-06-05 06:53:38] [INFO ] [Nat]Added 587 Read/Feed constraints in 109 ms returned sat
[2025-06-05 06:53:38] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2025-06-05 06:53:39] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2025-06-05 06:53:39] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:53:39] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 3 ms to minimize.
[2025-06-05 06:53:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 525 ms
[2025-06-05 06:53:39] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 58 ms.
[2025-06-05 06:53:39] [INFO ] Added : 22 causal constraints over 5 iterations in 367 ms. Result :sat
Minimization took 570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[29, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[29, 1]
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 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 234
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 228
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 412 place count 138 transition count 185
Iterating global reduction 2 with 43 rules applied. Total rules applied 455 place count 138 transition count 185
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 473 place count 138 transition count 167
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 498 place count 113 transition count 141
Iterating global reduction 3 with 25 rules applied. Total rules applied 523 place count 113 transition count 141
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 537 place count 113 transition count 127
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 545 place count 105 transition count 116
Iterating global reduction 4 with 8 rules applied. Total rules applied 553 place count 105 transition count 116
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 561 place count 97 transition count 108
Iterating global reduction 4 with 8 rules applied. Total rules applied 569 place count 97 transition count 108
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 574 place count 92 transition count 102
Iterating global reduction 4 with 5 rules applied. Total rules applied 579 place count 92 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 581 place count 92 transition count 100
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 585 place count 88 transition count 96
Iterating global reduction 5 with 4 rules applied. Total rules applied 589 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 591 place count 86 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 593 place count 86 transition count 94
Applied a total of 593 rules in 80 ms. Remains 86 /259 variables (removed 173) and now considering 94/749 (removed 655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 86/259 places, 94/749 transitions.
// Phase 1: matrix 94 rows 86 cols
[2025-06-05 06:53:40] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[29, 1]
RANDOM walk for 1000000 steps (224732 resets) in 800 ms. (1248 steps per ms)
BEST_FIRST walk for 2000001 steps (207217 resets) in 781 ms. (2557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[29, 1]
[2025-06-05 06:53:41] [INFO ] Invariant cache hit.
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:53:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 06:53:42] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:42] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 6 ms.
[2025-06-05 06:53:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-05 06:53:42] [INFO ] Added : 15 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 36 ms.
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Real]Added 36 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:53:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:53:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:42] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 5 ms.
[2025-06-05 06:53:42] [INFO ] Added : 19 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[29, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[29, 1]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/86 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-06-05 06:53:42] [INFO ] Invariant cache hit.
[2025-06-05 06:53:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 06:53:42] [INFO ] Invariant cache hit.
[2025-06-05 06:53:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 06:53:42] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2025-06-05 06:53:42] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-05 06:53:42] [INFO ] Invariant cache hit.
[2025-06-05 06:53:42] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-05 06:53:43] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/180 variables, 86/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 36/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-05 06:53:44] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/180 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/180 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 128 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/180 variables, 86/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 93/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 221 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5090 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 2/2 constraints]
After SMT, in 8758ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8973 ms. Remains : 86/86 places, 94/94 transitions.
RANDOM walk for 40000 steps (8948 resets) in 956 ms. (41 steps per ms) remains 4/4 properties
[2025-06-05 06:53:51] [INFO ] Flatten gal took : 70 ms
[2025-06-05 06:53:51] [INFO ] Flatten gal took : 17 ms
[2025-06-05 06:53:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12210656991895867860.gal : 8 ms
BEST_FIRST walk for 40002 steps (4150 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
[2025-06-05 06:53:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7470442749738395604.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/ReachabilityCardinality12210656991895867860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7470442749738395604.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/ReachabilityCardinality7470442749738395604.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40003 steps (4100 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
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 141
BEST_FIRST walk for 40002 steps (4214 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :141 after 173
BEST_FIRST walk for 40002 steps (4049 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :173 after 777
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :777 after 2595
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2595 after 4509
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4509 after 8093
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8093 after 15687
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15687 after 26141
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :26141 after 54839
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,71135,0.194815,11628,2,2642,18,26969,7,0,441,17771,0
Total reachable state count : 71135
Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.196276,11628,1,0,18,26969,7,0,442,17771,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2568,0.196944,11888,2,714,18,26969,8,0,444,17771,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,8,0.197228,11888,2,107,18,26969,9,0,446,17771,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,8,0.197489,11888,2,107,18,26969,10,0,447,17771,0
Probably explored full state space saw : 71135 states, properties seen :3
Probabilistic random walk after 182216 steps, saw 71135 distinct states, run finished after 289 ms. (steps per millisecond=630 ) properties seen :3
Explored full state space saw : 71135 states, properties seen :0
Exhaustive walk after 182216 steps, saw 71135 distinct states, run finished after 129 ms. (steps per millisecond=1412 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[29]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
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:[29]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:53:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 10000 steps (2256 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1080 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:53:52] [INFO ] Invariant cache hit.
[2025-06-05 06:53:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:53:52] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-05 06:53:52] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:53:52] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2025-06-05 06:53:52] [INFO ] Computed and/alt/rep : 24/54/24 causal constraints (skipped 69 transitions) in 9 ms.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-05 06:53:52] [INFO ] Added : 15 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 94/94 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 84 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 83 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 83 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 82 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 81 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 80 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 79 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 78 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 78 transition count 83
Applied a total of 17 rules in 18 ms. Remains 78 /86 variables (removed 8) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 78/86 places, 83/94 transitions.
// Phase 1: matrix 83 rows 78 cols
[2025-06-05 06:53:52] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (224530 resets) in 667 ms. (1497 steps per ms)
BEST_FIRST walk for 1000001 steps (103552 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:53:53] [INFO ] Invariant cache hit.
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:53:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:53:53] [INFO ] [Real]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:53:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:53] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 61 transitions) in 5 ms.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-05 06:53:54] [INFO ] Added : 14 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 78/78 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-05 06:53:54] [INFO ] Invariant cache hit.
[2025-06-05 06:53:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 06:53:54] [INFO ] Invariant cache hit.
[2025-06-05 06:53:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:53:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2025-06-05 06:53:54] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-05 06:53:54] [INFO ] Invariant cache hit.
[2025-06-05 06:53:54] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/161 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 114 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/161 variables, 78/83 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 82/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 196 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints]
After SMT, in 5564ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5745 ms. Remains : 78/78 places, 83/83 transitions.
[2025-06-05 06:53:59] [INFO ] Flatten gal took : 12 ms
[2025-06-05 06:53:59] [INFO ] Flatten gal took : 12 ms
[2025-06-05 06:53:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13586713091911346985.gal : 3 ms
[2025-06-05 06:53:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6284547934513082616.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/ReachabilityCardinality13586713091911346985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6284547934513082616.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8889 resets) in 133 ms. (298 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/ReachabilityCardinality6284547934513082616.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40003 steps (4101 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
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 333
BEST_FIRST walk for 40002 steps (4109 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :333 after 2073
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2073 after 3885
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3885 after 4705
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4705 after 14279
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :14279 after 25143
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51723 after 53475
Probably explored full state space saw : 65913 states, properties seen :1
Probabilistic random walk after 167747 steps, saw 65913 distinct states, run finished after 155 ms. (steps per millisecond=1082 ) properties seen :1
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,65913,0.217847,13012,2,2290,17,35544,7,0,398,20316,0
Total reachable state count : 65913
Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.218356,13012,1,0,17,35544,7,0,399,20316,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2346,0.218819,13276,2,512,17,35544,8,0,401,20316,0
Explored full state space saw : 65913 states, properties seen :0
Exhaustive walk after 167747 steps, saw 65913 distinct states, run finished after 111 ms. (steps per millisecond=1511 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[29]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 in 7762 ms.
[2025-06-05 06:54:00] [INFO ] Flatten gal took : 8 ms
[2025-06-05 06:54:00] [INFO ] Applying decomposition
[2025-06-05 06:54:00] [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/graph9701652366151844244.txt' '-o' '/tmp/graph9701652366151844244.bin' '-w' '/tmp/graph9701652366151844244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9701652366151844244.bin' '-l' '-1' '-v' '-w' '/tmp/graph9701652366151844244.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:54:00] [INFO ] Decomposing Gal with order
[2025-06-05 06:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:54:00] [INFO ] Removed a total of 80 redundant transitions.
[2025-06-05 06:54:00] [INFO ] Flatten gal took : 35 ms
[2025-06-05 06:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 8 ms.
[2025-06-05 06:54:00] [INFO ] Time to serialize gal into /tmp/UpperBounds8437159292628404416.gal : 3 ms
[2025-06-05 06:54:00] [INFO ] Time to serialize properties into /tmp/UpperBounds2784424743641164169.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/UpperBounds8437159292628404416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2784424743641164169.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 ...283
Loading property file /tmp/UpperBounds2784424743641164169.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,71135,0.184578,12984,701,622,12980,6247,296,27711,98,33831,0
Total reachable state count : 71135
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 :0 <= i9.u17.p78 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 1 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-d1m06-UpperBounds-04,0,0.200967,12984,1,0,12980,6247,409,27711,120,33831,581
Total runtime 25266 ms.
BK_STOP 1749106440686
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d1m06"
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-d1m06, 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-174902009200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m06.tgz
mv SieveSingleMsgMbox-PT-d1m06 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 '
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 ;