Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292600049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 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-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654744903237

Running Version 0
[2022-06-09 03:21:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:21:45] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2022-06-09 03:21:45] [INFO ] Transformed 553 places.
[2022-06-09 03:21:45] [INFO ] Transformed 150 transitions.
[2022-06-09 03:21:45] [INFO ] Parsed PT model containing 553 places and 150 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:21:45] [INFO ] Computed 6 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2327 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1003 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1001 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:21:45] [INFO ] Computed 6 place invariants in 12 ms
[2022-06-09 03:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:21:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:45] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-06-09 03:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:21:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 03:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:45] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:21:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 03:21:45] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:21:45] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 4 ms to minimize.
[2022-06-09 03:21:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:21:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-06-09 03:21:45] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2022-06-09 03:21:46] [INFO ] Added : 31 causal constraints over 7 iterations in 149 ms. Result :sat
Minimization took 38 ms.
[2022-06-09 03:21:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:46] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:21:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:46] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 14 ms returned sat
[2022-06-09 03:21:46] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-06-09 03:21:46] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2022-06-09 03:21:46] [INFO ] Added : 34 causal constraints over 7 iterations in 107 ms. Result :sat
Minimization took 59 ms.
[2022-06-09 03:21:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:21:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1] Max seen :[0, 0, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 29300 steps, including 5781 resets, run finished after 69 ms. (steps per millisecond=424 ) properties (out of 2) seen :1 could not realise parikh vector
Incomplete Parikh walk after 29600 steps, including 5615 resets, run finished after 57 ms. (steps per millisecond=519 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions, 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.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions 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 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 97
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 96
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 69 transition count 86
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 67 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 66 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 65 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 64 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 64 transition count 74
Applied a total of 94 rules in 41 ms. Remains 64 /109 variables (removed 45) and now considering 74/150 (removed 76) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/109 places, 74/150 transitions.
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 03:21:46] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228929 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 102020 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 102111 resets, run finished after 362 ms. (steps per millisecond=2762 ) properties (out of 2) seen :1
// Phase 1: matrix 74 rows 64 cols
[2022-06-09 03:21:48] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:21:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:48] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2022-06-09 03:21:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:21:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 03:21:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2022-06-09 03:21:48] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2022-06-09 03:21:48] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:21:48] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2022-06-09 03:21:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:21:48] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2022-06-09 03:21:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 160 ms
[2022-06-09 03:21:48] [INFO ] Computed and/alt/rep : 21/43/21 causal constraints (skipped 52 transitions) in 7 ms.
[2022-06-09 03:21:48] [INFO ] Added : 21 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1, 4] Max seen :[1, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 13800 steps, including 2785 resets, run finished after 17 ms. (steps per millisecond=811 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 64/64 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 72
Applied a total of 4 rules in 9 ms. Remains 62 /64 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/64 places, 72/74 transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:48] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229000 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102040 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:49] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:21:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:21:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:21:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:21:49] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-06-09 03:21:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:21:49] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-06-09 03:21:49] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2022-06-09 03:21:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 128 ms
[2022-06-09 03:21:49] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 7 ms.
[2022-06-09 03:21:49] [INFO ] Added : 20 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 13800 steps, including 2830 resets, run finished after 18 ms. (steps per millisecond=766 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:21:49] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:21:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:21:49] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2022-06-09 03:21:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:49] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 03:21:50] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:50] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:21:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:21:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:21:50] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:21:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 10 ms returned sat
[2022-06-09 03:21:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-06-09 03:21:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2022-06-09 03:21:50] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:21:50] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:21:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2022-06-09 03:21:50] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 9 ms.
[2022-06-09 03:21:50] [INFO ] Added : 20 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15100 steps, including 3121 resets, run finished after 13 ms. (steps per millisecond=1161 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:50] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229179 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102146 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 1) seen :0
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:21:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:51] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:21:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:21:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:21:51] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:21:51] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:21:51] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:21:51] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2022-06-09 03:21:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:21:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 145 ms
[2022-06-09 03:21:51] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 9 ms.
[2022-06-09 03:21:51] [INFO ] Added : 20 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15100 steps, including 3146 resets, run finished after 20 ms. (steps per millisecond=755 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:21:51] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:21:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:21:51] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-06-09 03:21:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 03:21:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:21:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 72/72 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-03 in 1807 ms.
[2022-06-09 03:21:51] [INFO ] Flatten gal took : 34 ms
[2022-06-09 03:21:51] [INFO ] Applying decomposition
[2022-06-09 03:21:52] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3421733332038965117.txt, -o, /tmp/graph3421733332038965117.bin, -w, /tmp/graph3421733332038965117.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3421733332038965117.bin, -l, -1, -v, -w, /tmp/graph3421733332038965117.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:21:52] [INFO ] Decomposing Gal with order
[2022-06-09 03:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:21:52] [INFO ] Removed a total of 54 redundant transitions.
[2022-06-09 03:21:52] [INFO ] Flatten gal took : 40 ms
[2022-06-09 03:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 7 ms.
[2022-06-09 03:21:52] [INFO ] Time to serialize gal into /tmp/UpperBounds15487991410255644813.gal : 4 ms
[2022-06-09 03:21:52] [INFO ] Time to serialize properties into /tmp/UpperBounds14806178720102986879.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15487991410255644813.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14806178720102986879.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15487991410255644813.gal -t CGAL -reachable-file /tmp/UpperBounds14806178720102986879.prop --nowitness
Loading property file /tmp/UpperBounds14806178720102986879.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,4894,0.073652,6296,286,337,2949,3278,230,4508,111,12532,0
Total reachable state count : 4894

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m04-UpperBounds-03 :0 <= i6.u4.l489 <= 1
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 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-d0m04-UpperBounds-03,0,0.078296,6296,1,0,2949,3278,306,4508,133,12532,265

BK_STOP 1654744913396

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d0m04, 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 r323-tall-165472292600049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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