Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208300306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is DBSingleClientW-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208300306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716324921897

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 20:55: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]
[2024-05-21 20:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:55:23] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 20:55:23] [INFO ] Transformed 1440 places.
[2024-05-21 20:55:23] [INFO ] Transformed 672 transitions.
[2024-05-21 20:55:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 20:55:23] [INFO ] Computed 6 invariants in 45 ms
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 958 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 973 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
[2024-05-21 20:55:23] [INFO ] Invariant cache hit.
[2024-05-21 20:55:24] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 20:55:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 20:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:24] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-21 20:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 20:55:24] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:55:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:24] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-21 20:55:24] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 20:55:24] [INFO ] [Nat]Added 418 Read/Feed constraints in 86 ms returned sat
[2024-05-21 20:55:24] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 5 ms to minimize.
[2024-05-21 20:55:25] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 0 ms to minimize.
[2024-05-21 20:55:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2024-05-21 20:55:25] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 131 ms.
[2024-05-21 20:55:25] [INFO ] Added : 10 causal constraints over 2 iterations in 317 ms. Result :sat
Minimization took 121 ms.
[2024-05-21 20:55:25] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:55:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 20:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:25] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-21 20:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-21 20:55:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:25] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-21 20:55:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 87 ms returned sat
[2024-05-21 20:55:26] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 1 ms to minimize.
[2024-05-21 20:55:26] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:55:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2024-05-21 20:55:26] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 63 ms.
[2024-05-21 20:55:26] [INFO ] Added : 4 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 114 ms.
[2024-05-21 20:55:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:55:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 20:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:26] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-21 20:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 20:55:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 20:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:27] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-21 20:55:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 63 ms returned sat
[2024-05-21 20:55:27] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2024-05-21 20:55:27] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2024-05-21 20:55:27] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2024-05-21 20:55:27] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 0 ms to minimize.
[2024-05-21 20:55:27] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 0 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2024-05-21 20:55:30] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2024-05-21 20:55:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 3073 ms
Current structural bounds on expressions (after SMT) : [857, 857, 1] Max seen :[0, 0, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 326 transition count 587
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 182 place count 230 transition count 329
Iterating global reduction 1 with 96 rules applied. Total rules applied 278 place count 230 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 282 place count 230 transition count 325
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 356 place count 156 transition count 251
Iterating global reduction 2 with 74 rules applied. Total rules applied 430 place count 156 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 436 place count 156 transition count 245
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 478 place count 114 transition count 177
Iterating global reduction 3 with 42 rules applied. Total rules applied 520 place count 114 transition count 177
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 543 place count 114 transition count 154
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 555 place count 102 transition count 135
Iterating global reduction 4 with 12 rules applied. Total rules applied 567 place count 102 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 102 transition count 133
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 578 place count 93 transition count 124
Iterating global reduction 5 with 9 rules applied. Total rules applied 587 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 590 place count 93 transition count 121
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 597 place count 86 transition count 114
Iterating global reduction 6 with 7 rules applied. Total rules applied 604 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 607 place count 86 transition count 111
Applied a total of 607 rules in 92 ms. Remains 86 /347 variables (removed 261) and now considering 111/672 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 86/347 places, 111/672 transitions.
// Phase 1: matrix 111 rows 86 cols
[2024-05-21 20:55:30] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229843 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98351 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 99268 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 2) seen :1
[2024-05-21 20:55:32] [INFO ] Invariant cache hit.
[2024-05-21 20:55:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 20:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:55:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 20:55:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:55:32] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 81 transitions) in 7 ms.
[2024-05-21 20:55:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-21 20:55:32] [INFO ] Added : 9 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 19 ms.
[2024-05-21 20:55:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:32] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [857, 1] Max seen :[0, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 269 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 107
Applied a total of 5 rules in 8 ms. Remains 84 /86 variables (removed 2) and now considering 107/111 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 84/86 places, 107/111 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 20:55:32] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229750 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98878 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :0
[2024-05-21 20:55:33] [INFO ] Invariant cache hit.
[2024-05-21 20:55:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:55:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:55:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 20:55:33] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 5 ms.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-21 20:55:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 284 ms
[2024-05-21 20:55:34] [INFO ] Added : 15 causal constraints over 4 iterations in 334 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [857] Max seen :[0]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
[2024-05-21 20:55:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
[2024-05-21 20:55:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:55:34] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-21 20:55:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
[2024-05-21 20:55:34] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 84/84 places, 107/107 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-00
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 998 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
[2024-05-21 20:55:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:55:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:55:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:55:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2024-05-21 20:55:34] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 5 ms.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
[2024-05-21 20:55:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 314 ms
[2024-05-21 20:55:34] [INFO ] Added : 15 causal constraints over 4 iterations in 361 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/84 places, 107/107 transitions.
[2024-05-21 20:55:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229715 resets, run finished after 746 ms. (steps per millisecond=1340 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98914 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 1) seen :0
[2024-05-21 20:55:35] [INFO ] Invariant cache hit.
[2024-05-21 20:55:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 20:55:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:55:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:55:36] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 20:55:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:55:36] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:55:36] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 7 ms.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-21 20:55:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 299 ms
[2024-05-21 20:55:36] [INFO ] Added : 15 causal constraints over 4 iterations in 343 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 20:55:36] [INFO ] Invariant cache hit.
[2024-05-21 20:55:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:55:36] [INFO ] Invariant cache hit.
[2024-05-21 20:55:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:55:36] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-21 20:55:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:55:36] [INFO ] Invariant cache hit.
[2024-05-21 20:55:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 84/84 places, 107/107 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-00 in 2412 ms.
[2024-05-21 20:55:36] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:55:36] [INFO ] Applying decomposition
[2024-05-21 20:55:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13623768380839236988.txt' '-o' '/tmp/graph13623768380839236988.bin' '-w' '/tmp/graph13623768380839236988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13623768380839236988.bin' '-l' '-1' '-v' '-w' '/tmp/graph13623768380839236988.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:55:36] [INFO ] Decomposing Gal with order
[2024-05-21 20:55:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:55:36] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-21 20:55:37] [INFO ] Flatten gal took : 35 ms
[2024-05-21 20:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 6 ms.
[2024-05-21 20:55:37] [INFO ] Time to serialize gal into /tmp/UpperBounds8464072635157213794.gal : 3 ms
[2024-05-21 20:55:37] [INFO ] Time to serialize properties into /tmp/UpperBounds3643773020008315184.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8464072635157213794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3643773020008315184.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds3643773020008315184.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,9469,0.069876,6712,347,378,4509,2128,309,9407,165,11292,0
Total reachable state count : 9469

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-00 :0 <= i4.u8.l296 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-00 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-d1m04-UpperBounds-00,0,0.074238,6968,1,0,4509,2128,400,9407,203,11292,355
Total runtime 13856 ms.

BK_STOP 1716324938256

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d1m04, 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 r109-tall-171624208300306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;