Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 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-d0m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174488566

Running Version 202205111006
[2023-03-07 07:34:49] [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]
[2023-03-07 07:34:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:34:50] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-07 07:34:50] [INFO ] Transformed 553 places.
[2023-03-07 07:34:50] [INFO ] Transformed 150 transitions.
[2023-03-07 07:34:50] [INFO ] Parsed PT model containing 553 places and 150 transitions in 183 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-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-07 07:34:50] [INFO ] Computed 6 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1061 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
// Phase 1: matrix 150 rows 109 cols
[2023-03-07 07:34:50] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-07 07:34:50] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-07 07:34:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-07 07:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:50] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-07 07:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-07 07:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-07 07:34:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-07 07:34:50] [INFO ] [Nat]Added 74 Read/Feed constraints in 13 ms returned sat
[2023-03-07 07:34:50] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 3 ms to minimize.
[2023-03-07 07:34:50] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2023-03-07 07:34:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-07 07:34:50] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2023-03-07 07:34:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-07 07:34:51] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 971 ms
[2023-03-07 07:34:51] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 20 ms.
[2023-03-07 07:34:51] [INFO ] Added : 18 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 41 ms.
[2023-03-07 07:34:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 1] Max seen :[0, 1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 96
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 95
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 66 transition count 83
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 63 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 61 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 59 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 59 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 58 transition count 67
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 58 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 107 place count 58 transition count 65
Applied a total of 107 rules in 40 ms. Remains 58 /109 variables (removed 51) and now considering 65/150 (removed 85) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/109 places, 65/150 transitions.
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:51] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229556 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102217 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :0
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:52] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 07:34:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-07 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-07 07:34:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:53] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2023-03-07 07:34:53] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 6 ms.
[2023-03-07 07:34:53] [INFO ] Added : 9 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:53] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:53] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-07 07:34:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:34:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 65/65 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:34:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-07 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-07 07:34:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:53] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:53] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 6 ms.
[2023-03-07 07:34:53] [INFO ] Added : 9 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 65/65 transitions.
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229406 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101159 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 1) seen :0
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:54] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-07 07:34:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:54] [INFO ] [Nat]Added 19 Read/Feed constraints in 7 ms returned sat
[2023-03-07 07:34:54] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 8 ms.
[2023-03-07 07:34:54] [INFO ] Added : 9 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:54] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-07 07:34:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 58 cols
[2023-03-07 07:34:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 65/65 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08 in 1417 ms.
[2023-03-07 07:34:54] [INFO ] Flatten gal took : 32 ms
[2023-03-07 07:34:54] [INFO ] Applying decomposition
[2023-03-07 07:34:54] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9597913772845300052.txt' '-o' '/tmp/graph9597913772845300052.bin' '-w' '/tmp/graph9597913772845300052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9597913772845300052.bin' '-l' '-1' '-v' '-w' '/tmp/graph9597913772845300052.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:34:55] [INFO ] Decomposing Gal with order
[2023-03-07 07:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:34:55] [INFO ] Removed a total of 53 redundant transitions.
[2023-03-07 07:34:55] [INFO ] Flatten gal took : 38 ms
[2023-03-07 07:34:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 6 ms.
[2023-03-07 07:34:55] [INFO ] Time to serialize gal into /tmp/UpperBounds9402089106459097231.gal : 4 ms
[2023-03-07 07:34:55] [INFO ] Time to serialize properties into /tmp/UpperBounds5666796600909246836.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9402089106459097231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5666796600909246836.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds5666796600909246836.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,134624,0.457569,16792,653,371,17019,4089,225,66828,90,35060,0
Total reachable state count : 134624

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m06-UpperBounds-08 :0 <= i5.u11.p30 <= 1
FORMULA DBSingleClientW-PT-d0m06-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-d0m06-UpperBounds-08,0,0.48983,16792,1,0,17019,4089,288,66828,114,35060,500
Total runtime 5619 ms.

BK_STOP 1678174495667

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-d0m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is DBSingleClientW-PT-d0m06, 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 r127-tall-167814504300025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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