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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654744981959

Running Version 0
[2022-06-09 03:23:03] [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:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:23:03] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-06-09 03:23:03] [INFO ] Transformed 553 places.
[2022-06-09 03:23:03] [INFO ] Transformed 150 transitions.
[2022-06-09 03:23:03] [INFO ] Parsed PT model containing 553 places and 150 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:23:03] [INFO ] Computed 6 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1018 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:23:03] [INFO ] Computed 6 place invariants in 8 ms
[2022-06-09 03:23:04] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:23:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:04] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-06-09 03:23:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 03:23:04] [INFO ] [Real]Added 74 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:23:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:04] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:23:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:23:04] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-06-09 03:23:05] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2022-06-09 03:23:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 829 ms
[2022-06-09 03:23:05] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2022-06-09 03:23:05] [INFO ] Added : 34 causal constraints over 7 iterations in 157 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 25000 steps, including 4440 resets, run finished after 67 ms. (steps per millisecond=373 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 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.2 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 59 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 59 transition count 67
Applied a total of 104 rules in 43 ms. Remains 59 /109 variables (removed 50) and now considering 67/150 (removed 83) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/109 places, 67/150 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:05] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228595 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101658 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :2
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:06] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:23:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:06] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:06] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-06-09 03:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-06-09 03:23:06] [INFO ] Added : 19 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 12100 steps, including 2050 resets, run finished after 17 ms. (steps per millisecond=711 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:06] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:06] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 03:23:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:06] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-10
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1087 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-09 03:23:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:06] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:06] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:07] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2022-06-09 03:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-06-09 03:23:07] [INFO ] Added : 19 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 12100 steps, including 1924 resets, run finished after 20 ms. (steps per millisecond=605 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:07] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229019 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101695 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 1) seen :2
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:23:08] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 5 ms.
[2022-06-09 03:23:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 03:23:08] [INFO ] Added : 19 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 12100 steps, including 2022 resets, run finished after 15 ms. (steps per millisecond=806 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:08] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:08] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-06-09 03:23:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:08] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229040 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101756 resets, run finished after 330 ms. (steps per millisecond=3030 ) properties (out of 1) seen :2
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:23:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:09] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-06-09 03:23:09] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 5 ms.
[2022-06-09 03:23:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-06-09 03:23:09] [INFO ] Added : 19 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 12100 steps, including 1996 resets, run finished after 13 ms. (steps per millisecond=930 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:23:09] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-06-09 03:23:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:09] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 03:23:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-10 in 2775 ms.
[2022-06-09 03:23:09] [INFO ] Flatten gal took : 31 ms
[2022-06-09 03:23:09] [INFO ] Applying decomposition
[2022-06-09 03:23:09] [INFO ] Flatten gal took : 9 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/graph795717845489713671.txt, -o, /tmp/graph795717845489713671.bin, -w, /tmp/graph795717845489713671.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/graph795717845489713671.bin, -l, -1, -v, -w, /tmp/graph795717845489713671.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:23:09] [INFO ] Decomposing Gal with order
[2022-06-09 03:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:23:09] [INFO ] Removed a total of 62 redundant transitions.
[2022-06-09 03:23:09] [INFO ] Flatten gal took : 40 ms
[2022-06-09 03:23:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 7 ms.
[2022-06-09 03:23:09] [INFO ] Time to serialize gal into /tmp/UpperBounds14268324569066755927.gal : 9 ms
[2022-06-09 03:23:09] [INFO ] Time to serialize properties into /tmp/UpperBounds2016224778570271212.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/UpperBounds14268324569066755927.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2016224778570271212.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/UpperBounds14268324569066755927.gal -t CGAL -reachable-file /tmp/UpperBounds2016224778570271212.prop --nowitness
Loading property file /tmp/UpperBounds2016224778570271212.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,3.48878e+06,7.15077,158240,1904,642,75842,15429,229,1.60221e+06,69,131483,0
Total reachable state count : 3488785

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-10 :0 <= i0.u9.l334 <= 3
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 3 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-d0m08-UpperBounds-10,0,7.32729,158240,1,0,75842,15429,303,1.60221e+06,89,131483,1099

BK_STOP 1654744998661

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

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