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.r069-smll-174854075800006.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 DBSingleClientW-PT-d0m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K 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.7K 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:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K May 29 14:32 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 DBSingleClientW-PT-d0m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601620680

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:40:23] [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-05-30 10:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:40:23] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-05-30 10:40:23] [INFO ] Transformed 553 places.
[2025-05-30 10:40:23] [INFO ] Transformed 150 transitions.
[2025-05-30 10:40:23] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2025-05-30 10:40:23] [INFO ] Computed 6 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[4, 6, 6, 6]
RANDOM walk for 10000 steps (2326 resets) in 88 ms. (112 steps per ms)
BEST_FIRST walk for 40003 steps (4087 resets) in 168 ms. (236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 1] Max Struct:[4, 6, 6, 6]
[2025-05-30 10:40:24] [INFO ] Invariant cache hit.
[2025-05-30 10:40:24] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:40:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:40:24] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-30 10:40:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-30 10:40:24] [INFO ] [Real]Added 74 Read/Feed constraints in 31 ms returned sat
[2025-05-30 10:40:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-05-30 10:40:24] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-30 10:40:24] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 24 ms returned sat
[2025-05-30 10:40:25] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 37 ms.
[2025-05-30 10:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 89 ms.
[2025-05-30 10:40:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
[2025-05-30 10:40:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Real]Added 74 Read/Feed constraints in 17 ms returned sat
[2025-05-30 10:40:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-05-30 10:40:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2025-05-30 10:40:25] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 34 ms to minimize.
[2025-05-30 10:40:25] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2025-05-30 10:40:25] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 3 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2025-05-30 10:40:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1139 ms
[2025-05-30 10:40:26] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 29 ms.
[2025-05-30 10:40:26] [INFO ] Added : 10 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 98 ms.
[2025-05-30 10:40:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-30 10:40:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 1] Max Struct:[4, 1, 6, 1]
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[4, 6]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 96
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 95
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 66 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 63 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 62 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 61 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 60 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 60 transition count 69
Applied a total of 101 rules in 81 ms. Remains 60 /109 variables (removed 49) and now considering 69/150 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 60/109 places, 69/150 transitions.
// Phase 1: matrix 69 rows 60 cols
[2025-05-30 10:40:27] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[4, 6]
RANDOM walk for 1000000 steps (229245 resets) in 1251 ms. (798 steps per ms)
BEST_FIRST walk for 2000001 steps (202917 resets) in 947 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0] Max Struct:[4, 6]
[2025-05-30 10:40:29] [INFO ] Invariant cache hit.
[2025-05-30 10:40:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-30 10:40:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 10:40:29] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:40:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:40:29] [INFO ] Computed and/alt/rep : 20/41/20 causal constraints (skipped 48 transitions) in 10 ms.
[2025-05-30 10:40:29] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 30 ms.
[2025-05-30 10:40:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:40:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-05-30 10:40:29] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2025-05-30 10:40:29] [INFO ] Computed and/alt/rep : 20/41/20 causal constraints (skipped 48 transitions) in 10 ms.
[2025-05-30 10:40:29] [INFO ] Added : 9 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0] Max Struct:[4, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[4, 6]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 60/60 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2025-05-30 10:40:29] [INFO ] Invariant cache hit.
[2025-05-30 10:40:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-30 10:40:29] [INFO ] Invariant cache hit.
[2025-05-30 10:40:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 10:40:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2025-05-30 10:40:30] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2025-05-30 10:40:30] [INFO ] Invariant cache hit.
[2025-05-30 10:40:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 82 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1950 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2611 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 4738ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 4750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5014 ms. Remains : 60/60 places, 69/69 transitions.
RANDOM walk for 40000 steps (9132 resets) in 2207 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3965 resets) in 512 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4053 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4032 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4063 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
[2025-05-30 10:40:36] [INFO ] Flatten gal took : 118 ms
[2025-05-30 10:40:36] [INFO ] Flatten gal took : 46 ms
[2025-05-30 10:40:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13492363640677539349.gal : 21 ms
[2025-05-30 10:40:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12692345148485209834.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/ReachabilityCardinality13492363640677539349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12692345148485209834.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 ...330
Loading property file /tmp/ReachabilityCardinality12692345148485209834.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 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 74
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :74 after 184
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :184 after 406
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :406 after 864
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :864 after 7431
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7431 after 33264
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :33264 after 102489
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :102489 after 328608
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :328608 after 1.32826e+06
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.32826e+06 after 8.73432e+06
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,1.2465e+07,2.39832,34024,2,11154,18,127742,9,0,314,120554,0
Total reachable state count : 12464993

Verifying 4 reachability properties.
Reachability property MAX0 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
MAX0,723,2.39938,34024,2,209,18,127742,9,0,316,120554,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,26848,2.40086,34024,2,997,18,127742,10,0,318,120554,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

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,0,2.40241,34024,1,0,18,127742,10,0,318,120554,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,4368,2.40308,34024,2,371,18,127742,10,0,319,120554,0
Interrupted probabilistic random walk after 797229 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :2 out of 4
Probabilistic random walk after 797229 steps, saw 322006 distinct states, run finished after 3006 ms. (steps per millisecond=265 ) properties seen :2
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-01 4 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[6]
Starting property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-10
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:40:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2308 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (1038 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:40:39] [INFO ] Invariant cache hit.
[2025-05-30 10:40:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:39] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-30 10:40:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 10:40:39] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:40:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:40:39] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-30 10:40:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:40:39] [INFO ] Computed and/alt/rep : 20/41/20 causal constraints (skipped 48 transitions) in 28 ms.
[2025-05-30 10:40:39] [INFO ] Added : 9 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 69/69 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 65
Applied a total of 6 rules in 22 ms. Remains 58 /60 variables (removed 2) and now considering 65/69 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 58/60 places, 65/69 transitions.
// Phase 1: matrix 65 rows 58 cols
[2025-05-30 10:40:39] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229029 resets) in 1028 ms. (971 steps per ms)
BEST_FIRST walk for 1000000 steps (101833 resets) in 381 ms. (2617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:40:40] [INFO ] Invariant cache hit.
[2025-05-30 10:40:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:41] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:40:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-30 10:40:41] [INFO ] [Real]Added 19 Read/Feed constraints in 5 ms returned sat
[2025-05-30 10:40:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:40:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:40:41] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-30 10:40:41] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:40:41] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 11 ms.
[2025-05-30 10:40:41] [INFO ] Added : 9 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-05-30 10:40:41] [INFO ] Invariant cache hit.
[2025-05-30 10:40:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 10:40:41] [INFO ] Invariant cache hit.
[2025-05-30 10:40:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-30 10:40:41] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2025-05-30 10:40:41] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-30 10:40:41] [INFO ] Invariant cache hit.
[2025-05-30 10:40:41] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 79 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1817 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 143 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3185 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 5134ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5449 ms. Remains : 58/58 places, 65/65 transitions.
[2025-05-30 10:40:46] [INFO ] Flatten gal took : 20 ms
[2025-05-30 10:40:46] [INFO ] Flatten gal took : 19 ms
[2025-05-30 10:40:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1872773598456588189.gal : 6 ms
[2025-05-30 10:40:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10463296279162995897.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/ReachabilityCardinality1872773598456588189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10463296279162995897.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
RANDOM walk for 40000 steps (9131 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10463296279162995897.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40003 steps (4119 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 74
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :74 after 150
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :150 after 346
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :346 after 718
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :718 after 4344
BEST_FIRST walk for 40001 steps (4160 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4344 after 13620
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :13620 after 65906
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :65906 after 232827
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :232827 after 465134
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :465134 after 2.04034e+06
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.25189e+06 after 6.88924e+06
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,7.75403e+06,1.89542,45520,2,12130,20,164954,7,0,300,174681,0
Total reachable state count : 7754034

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,1.89684,45520,1,0,20,164954,7,0,301,174681,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,9162,1.89779,45520,2,494,20,164954,8,0,303,174681,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 2814856 steps, run timeout after 3001 ms. (steps per millisecond=937 ) properties seen :1 out of 2
Probabilistic random walk after 2814856 steps, saw 1118417 distinct states, run finished after 3001 ms. (steps per millisecond=937 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-10 in 10659 ms.
[2025-05-30 10:40:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 10:40:49] [INFO ] Applying decomposition
[2025-05-30 10:40:49] [INFO ] Flatten gal took : 8 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/graph589475245682700534.txt' '-o' '/tmp/graph589475245682700534.bin' '-w' '/tmp/graph589475245682700534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph589475245682700534.bin' '-l' '-1' '-v' '-w' '/tmp/graph589475245682700534.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:40:50] [INFO ] Decomposing Gal with order
[2025-05-30 10:40:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:40:50] [INFO ] Removed a total of 65 redundant transitions.
[2025-05-30 10:40:50] [INFO ] Flatten gal took : 60 ms
[2025-05-30 10:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 11 ms.
[2025-05-30 10:40:50] [INFO ] Time to serialize gal into /tmp/UpperBounds9557034752752115795.gal : 5 ms
[2025-05-30 10:40:50] [INFO ] Time to serialize properties into /tmp/UpperBounds11302862416533985559.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/UpperBounds9557034752752115795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11302862416533985559.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11302862416533985559.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.2465e+07,4.96135,87428,1230,776,114864,16321,225,310393,66,132812,0
Total reachable state count : 12464993

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m09-UpperBounds-10 :0 <= i5.u2.p32 <= 1
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-10 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
DBSingleClientW-PT-d0m09-UpperBounds-10,0,5.08526,87428,1,0,114864,16321,300,310393,80,132812,484
Total runtime 32142 ms.

BK_STOP 1748601655484

--------------------
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="DBSingleClientW-PT-d0m09"
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 DBSingleClientW-PT-d0m09, 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 r069-smll-174854075800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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