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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 9.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 432K 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-d1m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745244060

Running Version 0
[2022-06-09 03:27:25] [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:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:27:25] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-06-09 03:27:25] [INFO ] Transformed 1440 places.
[2022-06-09 03:27:26] [INFO ] Transformed 672 transitions.
[2022-06-09 03:27:26] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:27:26] [INFO ] Computed 6 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2334 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:27:26] [INFO ] Computed 6 place invariants in 19 ms
[2022-06-09 03:27:26] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:27:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 03:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:26] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 03:27:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2022-06-09 03:27:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 03:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:26] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 03:27:27] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:27:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 378 ms returned sat
[2022-06-09 03:27:27] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2022-06-09 03:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2022-06-09 03:27:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 155 ms.
[2022-06-09 03:27:28] [INFO ] Added : 117 causal constraints over 24 iterations in 1271 ms. Result :sat
Minimization took 827 ms.
[2022-06-09 03:27:29] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2022-06-09 03:27:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2022-06-09 03:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:30] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-09 03:27:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:27:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:30] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-06-09 03:27:30] [INFO ] [Nat]Added 418 Read/Feed constraints in 207 ms returned sat
[2022-06-09 03:27:30] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2022-06-09 03:27:30] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2022-06-09 03:27:31] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2022-06-09 03:27:31] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 1 ms to minimize.
[2022-06-09 03:27:31] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2022-06-09 03:27:31] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 1 ms to minimize.
[2022-06-09 03:27:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1081 ms
[2022-06-09 03:27:31] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 83 ms.
[2022-06-09 03:27:32] [INFO ] Added : 113 causal constraints over 23 iterations in 1063 ms. Result :sat
Minimization took 682 ms.
Current structural bounds on expressions (after SMT) : [10, 7] Max seen :[0, 0]
Incomplete Parikh walk after 68000 steps, including 13105 resets, run finished after 320 ms. (steps per millisecond=212 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58200 steps, including 12122 resets, run finished after 247 ms. (steps per millisecond=235 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 359 place count 155 transition count 249
Iterating global reduction 2 with 74 rules applied. Total rules applied 433 place count 155 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 439 place count 155 transition count 243
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 482 place count 112 transition count 174
Iterating global reduction 3 with 43 rules applied. Total rules applied 525 place count 112 transition count 174
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 549 place count 112 transition count 150
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 561 place count 100 transition count 131
Iterating global reduction 4 with 12 rules applied. Total rules applied 573 place count 100 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 575 place count 100 transition count 129
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 583 place count 92 transition count 121
Iterating global reduction 5 with 8 rules applied. Total rules applied 591 place count 92 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 594 place count 92 transition count 118
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 600 place count 86 transition count 112
Iterating global reduction 6 with 6 rules applied. Total rules applied 606 place count 86 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 609 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 610 place count 85 transition count 107
Iterating global reduction 7 with 1 rules applied. Total rules applied 611 place count 85 transition count 107
Applied a total of 611 rules in 86 ms. Remains 85 /347 variables (removed 262) and now considering 107/672 (removed 565) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/347 places, 107/672 transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:34] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230043 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99012 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99033 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 2) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:27:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:27:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:27:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:36] [INFO ] [Nat]Added 35 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2022-06-09 03:27:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 286 ms
[2022-06-09 03:27:36] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 7 ms.
[2022-06-09 03:27:36] [INFO ] Added : 28 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 34 ms.
[2022-06-09 03:27:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-09 03:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:36] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-06-09 03:27:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:27:36] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:27:36] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:27:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-06-09 03:27:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2022-06-09 03:27:37] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 7 ms.
[2022-06-09 03:27:37] [INFO ] Added : 28 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [10, 7] Max seen :[0, 0]
Incomplete Parikh walk after 15300 steps, including 2668 resets, run finished after 22 ms. (steps per millisecond=695 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18400 steps, including 3229 resets, run finished after 23 ms. (steps per millisecond=800 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:27:37] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:27:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2022-06-09 03:27:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:27:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-07
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:37] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1030 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:27:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-09 03:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:37] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-09 03:27:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:37] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:27:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:37] [INFO ] [Nat]Added 35 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:27:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 289 ms
[2022-06-09 03:27:38] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 6 ms.
[2022-06-09 03:27:38] [INFO ] Added : 28 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 18400 steps, including 3265 resets, run finished after 21 ms. (steps per millisecond=876 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 82 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 82 transition count 99
Applied a total of 6 rules in 11 ms. Remains 82 /85 variables (removed 3) and now considering 99/107 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/85 places, 99/107 transitions.
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 03:27:38] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229276 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98588 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :0
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 03:27:39] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:27:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:27:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 03:27:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 03:27:39] [INFO ] [Nat]Added 29 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:27:39] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-06-09 03:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-09 03:27:39] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2022-06-09 03:27:39] [INFO ] Added : 27 causal constraints over 6 iterations in 54 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15800 steps, including 3338 resets, run finished after 26 ms. (steps per millisecond=607 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 03:27:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:27:39] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 03:27:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:27:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 03:27:40] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2022-06-09 03:27:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 03:27:40] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 03:27:40] [INFO ] Dead Transitions using invariants and state equation in 291 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-07 in 2703 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-14
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:40] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:40] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 03:27:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:40] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:27:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:27:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:40] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:27:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2022-06-09 03:27:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2022-06-09 03:27:40] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 5 ms.
[2022-06-09 03:27:40] [INFO ] Added : 28 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15300 steps, including 2661 resets, run finished after 22 ms. (steps per millisecond=695 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:40] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229528 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98582 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:41] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 03:27:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 03:27:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:27:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:27:42] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:27:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:42] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:27:42] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2022-06-09 03:27:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2022-06-09 03:27:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2022-06-09 03:27:42] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 6 ms.
[2022-06-09 03:27:42] [INFO ] Added : 28 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15300 steps, including 2650 resets, run finished after 20 ms. (steps per millisecond=765 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:27:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:27:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 03:27:42] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-06-09 03:27:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 03:27:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:27:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-14 in 2035 ms.
[2022-06-09 03:27:42] [INFO ] Flatten gal took : 65 ms
[2022-06-09 03:27:42] [INFO ] Applying decomposition
[2022-06-09 03:27:42] [INFO ] Flatten gal took : 14 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/graph1618061657464857031.txt, -o, /tmp/graph1618061657464857031.bin, -w, /tmp/graph1618061657464857031.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/graph1618061657464857031.bin, -l, -1, -v, -w, /tmp/graph1618061657464857031.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:27:42] [INFO ] Decomposing Gal with order
[2022-06-09 03:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:27:42] [INFO ] Removed a total of 119 redundant transitions.
[2022-06-09 03:27:42] [INFO ] Flatten gal took : 68 ms
[2022-06-09 03:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 19 ms.
[2022-06-09 03:27:42] [INFO ] Time to serialize gal into /tmp/UpperBounds3032341662555493707.gal : 10 ms
[2022-06-09 03:27:42] [INFO ] Time to serialize properties into /tmp/UpperBounds17028388065400969507.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/UpperBounds3032341662555493707.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17028388065400969507.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/UpperBounds3032341662555493707.gal -t CGAL -reachable-file /tmp/UpperBounds17028388065400969507.prop --nowitness
Loading property file /tmp/UpperBounds17028388065400969507.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10416e+07,6.03108,162332,2491,1052,183852,39985,358,821189,122,353780,0
Total reachable state count : 11041614

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m08-UpperBounds-07 :0 <= i0.u0.l531 <= 3
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-07 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-d1m08-UpperBounds-07,0,6.21435,162332,1,0,183852,39985,463,821189,160,353780,1961
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m08-UpperBounds-14 :0 <= i3.u9.p54 <= 1
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-14 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-d1m08-UpperBounds-14,0,6.22918,162332,1,0,183852,39985,489,821189,165,353780,2910

BK_STOP 1654745270110

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

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