Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716324736024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 20:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:52:17] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-21 20:52:17] [INFO ] Transformed 553 places.
[2024-05-21 20:52:17] [INFO ] Transformed 150 transitions.
[2024-05-21 20:52:17] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2024-05-21 20:52:17] [INFO ] Computed 6 invariants in 21 ms
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1040 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
[2024-05-21 20:52:17] [INFO ] Invariant cache hit.
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-21 20:52:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 20:52:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 20:52:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 24 ms returned sat
[2024-05-21 20:52:18] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 55 ms.
[2024-05-21 20:52:18] [INFO ] Added : 7 causal constraints over 2 iterations in 104 ms. Result :sat
Minimization took 65 ms.
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:18] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 20:52:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 20:52:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2024-05-21 20:52:18] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 5 ms to minimize.
[2024-05-21 20:52:18] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2024-05-21 20:52:18] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:52:18] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-21 20:52:19] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:52:20] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1768 ms
[2024-05-21 20:52:20] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 15 ms.
[2024-05-21 20:52:20] [INFO ] Added : 16 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [8, 6] Max seen :[0, 0]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 97
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 68 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 68 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 66 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 65 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 64 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 63 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 63 transition count 74
Applied a total of 95 rules in 37 ms. Remains 63 /109 variables (removed 46) and now considering 74/150 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 63/109 places, 74/150 transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 20:52:20] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228751 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101634 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102182 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 2) seen :0
[2024-05-21 20:52:22] [INFO ] Invariant cache hit.
[2024-05-21 20:52:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:22] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:52:22] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 5 ms.
[2024-05-21 20:52:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-21 20:52:22] [INFO ] Added : 13 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 29 ms.
[2024-05-21 20:52:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 20:52:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:22] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:22] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 20:52:22] [INFO ] Added : 9 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8, 6] Max seen :[1, 0]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:52:22] [INFO ] Invariant cache hit.
[2024-05-21 20:52:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:52:22] [INFO ] Invariant cache hit.
[2024-05-21 20:52:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:22] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 20:52:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:52:22] [INFO ] Invariant cache hit.
[2024-05-21 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 63/63 places, 74/74 transitions.
[2024-05-21 20:52:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229423 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101652 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101441 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 2) seen :0
[2024-05-21 20:52:23] [INFO ] Invariant cache hit.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:24] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:52:24] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 5 ms.
[2024-05-21 20:52:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-21 20:52:24] [INFO ] Added : 13 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 31 ms.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:52:24] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 5 ms.
[2024-05-21 20:52:24] [INFO ] Added : 9 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8, 6] Max seen :[1, 0]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 63/63 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:52:24] [INFO ] Invariant cache hit.
[2024-05-21 20:52:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:52:24] [INFO ] Invariant cache hit.
[2024-05-21 20:52:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:52:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:52:24] [INFO ] Invariant cache hit.
[2024-05-21 20:52:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 63/63 places, 74/74 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00
[2024-05-21 20:52:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2024-05-21 20:52:24] [INFO ] Invariant cache hit.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 20:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 20:52:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:24] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 20:52:24] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-21 20:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-21 20:52:24] [INFO ] Added : 9 causal constraints over 2 iterations in 74 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 72
Applied a total of 3 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 72/74 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/63 places, 72/74 transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-21 20:52:24] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229056 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101783 resets, run finished after 336 ms. (steps per millisecond=2976 ) properties (out of 1) seen :0
[2024-05-21 20:52:25] [INFO ] Invariant cache hit.
[2024-05-21 20:52:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-21 20:52:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:25] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:25] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:52:25] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 6 ms.
[2024-05-21 20:52:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-21 20:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-21 20:52:25] [INFO ] Added : 10 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-21 20:52:26] [INFO ] Invariant cache hit.
[2024-05-21 20:52:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:52:26] [INFO ] Invariant cache hit.
[2024-05-21 20:52:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 20:52:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:52:26] [INFO ] Invariant cache hit.
[2024-05-21 20:52:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 62/62 places, 72/72 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00 in 1681 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 20:52:26] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-21 20:52:26] [INFO ] Invariant cache hit.
[2024-05-21 20:52:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:52:26] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:26] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 5 ms.
[2024-05-21 20:52:26] [INFO ] Added : 9 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 58 transition count 65
Applied a total of 12 rules in 12 ms. Remains 58 /63 variables (removed 5) and now considering 65/74 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 58/63 places, 65/74 transitions.
// Phase 1: matrix 65 rows 58 cols
[2024-05-21 20:52:26] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229555 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102307 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 1) seen :0
[2024-05-21 20:52:27] [INFO ] Invariant cache hit.
[2024-05-21 20:52:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 20:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:52:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 20:52:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 20:52:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 20:52:27] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:52:27] [INFO ] Computed and/alt/rep : 19/37/19 causal constraints (skipped 45 transitions) in 4 ms.
[2024-05-21 20:52:27] [INFO ] Added : 9 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 8 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 REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 10 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 58/58 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 65/65 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-21 20:52:27] [INFO ] Invariant cache hit.
[2024-05-21 20:52:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:52:27] [INFO ] Invariant cache hit.
[2024-05-21 20:52:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 20:52:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-21 20:52:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:52:27] [INFO ] Invariant cache hit.
[2024-05-21 20:52:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 58/58 places, 65/65 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06 in 1434 ms.
[2024-05-21 20:52:27] [INFO ] Flatten gal took : 28 ms
[2024-05-21 20:52:27] [INFO ] Applying decomposition
[2024-05-21 20:52:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10712303072677369612.txt' '-o' '/tmp/graph10712303072677369612.bin' '-w' '/tmp/graph10712303072677369612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10712303072677369612.bin' '-l' '-1' '-v' '-w' '/tmp/graph10712303072677369612.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:52:27] [INFO ] Decomposing Gal with order
[2024-05-21 20:52:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:52:27] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-21 20:52:27] [INFO ] Flatten gal took : 33 ms
[2024-05-21 20:52:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 5 ms.
[2024-05-21 20:52:27] [INFO ] Time to serialize gal into /tmp/UpperBounds15612145091482085645.gal : 3 ms
[2024-05-21 20:52:27] [INFO ] Time to serialize properties into /tmp/UpperBounds4873712053164686846.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15612145091482085645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4873712053164686846.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4873712053164686846.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,6.32593e+06,2.47324,75976,1779,493,97071,11611,240,423479,62,53258,0
Total reachable state count : 6325930

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-00 :0 <= i1.u5.l487 <= 5
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-00 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m08-UpperBounds-00,0,2.7297,75976,1,0,97071,11611,317,423479,86,61289,1345
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-06 :0 <= i4.u11.p33 <= 1
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 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-d0m08-UpperBounds-06,0,2.74708,75976,1,0,97071,11611,339,423479,91,62181,1505
Total runtime 13276 ms.

BK_STOP 1716324751726

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d0m08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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