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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:11 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-d1m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745069060

Running Version 0
[2022-06-09 03:24:30] [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:24:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:24:30] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-09 03:24:30] [INFO ] Transformed 1440 places.
[2022-06-09 03:24:31] [INFO ] Transformed 672 transitions.
[2022-06-09 03:24:31] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:24:31] [INFO ] Computed 6 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 984 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 961 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:24:31] [INFO ] Computed 6 place invariants in 22 ms
[2022-06-09 03:24:31] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-09 03:24:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:31] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-09 03:24:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:24:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:31] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-09 03:24:32] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:24:32] [INFO ] [Nat]Added 418 Read/Feed constraints in 191 ms returned sat
[2022-06-09 03:24:32] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2022-06-09 03:24:32] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 1 ms to minimize.
[2022-06-09 03:24:32] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-06-09 03:24:33] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2022-06-09 03:24:33] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 5 ms to minimize.
[2022-06-09 03:24:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 984 ms
[2022-06-09 03:24:33] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 118 ms.
[2022-06-09 03:24:34] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2022-06-09 03:24:34] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-06-09 03:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2022-06-09 03:24:34] [INFO ] Added : 109 causal constraints over 22 iterations in 1550 ms. Result :sat
Minimization took 819 ms.
[2022-06-09 03:24:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:24:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 1] Max seen :[0, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 194200 steps, including 38241 resets, run finished after 784 ms. (steps per millisecond=247 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 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.6 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 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 358 place count 156 transition count 250
Iterating global reduction 2 with 73 rules applied. Total rules applied 431 place count 156 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 437 place count 156 transition count 244
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 479 place count 114 transition count 176
Iterating global reduction 3 with 42 rules applied. Total rules applied 521 place count 114 transition count 176
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 544 place count 114 transition count 153
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 556 place count 102 transition count 134
Iterating global reduction 4 with 12 rules applied. Total rules applied 568 place count 102 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 570 place count 102 transition count 132
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 579 place count 93 transition count 123
Iterating global reduction 5 with 9 rules applied. Total rules applied 588 place count 93 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 591 place count 93 transition count 120
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 598 place count 86 transition count 113
Iterating global reduction 6 with 7 rules applied. Total rules applied 605 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 608 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 609 place count 85 transition count 108
Iterating global reduction 7 with 1 rules applied. Total rules applied 610 place count 85 transition count 108
Applied a total of 610 rules in 96 ms. Remains 85 /347 variables (removed 262) and now considering 108/672 (removed 564) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/347 places, 108/672 transitions.
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:36] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229618 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98600 resets, run finished after 395 ms. (steps per millisecond=2531 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:24:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:24:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:24:37] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2022-06-09 03:24:37] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 13 ms.
[2022-06-09 03:24:37] [INFO ] Added : 28 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[0]
Incomplete Parikh walk after 16800 steps, including 3046 resets, run finished after 33 ms. (steps per millisecond=509 ) 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, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:24:38] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:24:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:24:38] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-09 03:24:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:24:38] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-08
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2286 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 1025 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:24:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:24:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 03:24:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:24:38] [INFO ] [Nat]Added 36 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:24:38] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2022-06-09 03:24:38] [INFO ] Added : 28 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16800 steps, including 2998 resets, run finished after 21 ms. (steps per millisecond=800 ) 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, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:38] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229950 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99646 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:39] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 03:24:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:24:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:24:39] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2022-06-09 03:24:39] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2022-06-09 03:24:39] [INFO ] Added : 28 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16800 steps, including 3090 resets, run finished after 25 ms. (steps per millisecond=672 ) 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, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 15 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:24:40] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:24:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:24:40] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-09 03:24:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 108 rows 85 cols
[2022-06-09 03:24:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:24:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-08 in 1964 ms.
[2022-06-09 03:24:40] [INFO ] Flatten gal took : 41 ms
[2022-06-09 03:24:40] [INFO ] Applying decomposition
[2022-06-09 03:24:40] [INFO ] Flatten gal took : 13 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/graph6569229182098771042.txt, -o, /tmp/graph6569229182098771042.bin, -w, /tmp/graph6569229182098771042.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/graph6569229182098771042.bin, -l, -1, -v, -w, /tmp/graph6569229182098771042.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:24:40] [INFO ] Decomposing Gal with order
[2022-06-09 03:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:24:40] [INFO ] Removed a total of 114 redundant transitions.
[2022-06-09 03:24:40] [INFO ] Flatten gal took : 37 ms
[2022-06-09 03:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2022-06-09 03:24:40] [INFO ] Time to serialize gal into /tmp/UpperBounds8603316298296746396.gal : 6 ms
[2022-06-09 03:24:40] [INFO ] Time to serialize properties into /tmp/UpperBounds17097966090659300436.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/UpperBounds8603316298296746396.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17097966090659300436.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/UpperBounds8603316298296746396.gal -t CGAL -reachable-file /tmp/UpperBounds17097966090659300436.prop --nowitness
Loading property file /tmp/UpperBounds17097966090659300436.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,9553,0.078589,6416,411,167,4171,893,341,7248,90,4127,0
Total reachable state count : 9553

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-08 :0 <= i4.u8.s9 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m04-UpperBounds-08,0,0.09203,6416,1,0,4171,893,443,7248,111,4127,471

BK_STOP 1654745081967

--------------------
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-d1m04"
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-d1m04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292600070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;