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.r480-tall-171624189400493.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 ltsminxred
Input is DBSingleClientW-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 432K 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-d1m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717189211738

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:00:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:00:13] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-31 21:00:13] [INFO ] Transformed 1440 places.
[2024-05-31 21:00:13] [INFO ] Transformed 672 transitions.
[2024-05-31 21:00:13] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-31 21:00:13] [INFO ] Computed 6 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[857, 857, 2]
RANDOM walk for 10000 steps (2315 resets) in 140 ms. (70 steps per ms)
BEST_FIRST walk for 30002 steps (2918 resets) in 147 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[857, 857, 2]
[2024-05-31 21:00:13] [INFO ] Invariant cache hit.
[2024-05-31 21:00:14] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:00:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-31 21:00:14] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:00:14] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-31 21:00:14] [INFO ] [Real]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-31 21:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:00:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:00:14] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:00:14] [INFO ] [Nat]Added 418 Read/Feed constraints in 86 ms returned sat
[2024-05-31 21:00:15] [INFO ] Deduced a trap composed of 103 places in 225 ms of which 42 ms to minimize.
[2024-05-31 21:00:15] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 4 ms to minimize.
[2024-05-31 21:00:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2024-05-31 21:00:15] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 114 ms.
[2024-05-31 21:00:15] [INFO ] Added : 10 causal constraints over 2 iterations in 310 ms. Result :sat
Minimization took 532 ms.
[2024-05-31 21:00:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Real]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-31 21:00:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:00:16] [INFO ] [Nat]Added 418 Read/Feed constraints in 97 ms returned sat
[2024-05-31 21:00:17] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-05-31 21:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-31 21:00:17] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2024-05-31 21:00:17] [INFO ] Added : 4 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 609 ms.
[2024-05-31 21:00:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:00:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:00:18] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:00:18] [INFO ] [Real]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-31 21:00:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:00:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:00:18] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:00:18] [INFO ] [Nat]Added 418 Read/Feed constraints in 70 ms returned sat
[2024-05-31 21:00:18] [INFO ] Deduced a trap composed of 27 places in 342 ms of which 12 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 2 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-31 21:00:19] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-05-31 21:00:20] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-05-31 21:00:20] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-05-31 21:00:20] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-31 21:00:20] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-05-31 21:00:21] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2024-05-31 21:00:21] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 3061 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[857, 857, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[857, 857, 2]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 326 transition count 587
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 182 place count 230 transition count 329
Iterating global reduction 1 with 96 rules applied. Total rules applied 278 place count 230 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 282 place count 230 transition count 325
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 356 place count 156 transition count 251
Iterating global reduction 2 with 74 rules applied. Total rules applied 430 place count 156 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 436 place count 156 transition count 245
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 478 place count 114 transition count 177
Iterating global reduction 3 with 42 rules applied. Total rules applied 520 place count 114 transition count 177
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 543 place count 114 transition count 154
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 554 place count 103 transition count 137
Iterating global reduction 4 with 11 rules applied. Total rules applied 565 place count 103 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 567 place count 103 transition count 135
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 575 place count 95 transition count 127
Iterating global reduction 5 with 8 rules applied. Total rules applied 583 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 586 place count 95 transition count 124
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 592 place count 89 transition count 118
Iterating global reduction 6 with 6 rules applied. Total rules applied 598 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 600 place count 89 transition count 116
Applied a total of 600 rules in 94 ms. Remains 89 /347 variables (removed 258) and now considering 116/672 (removed 556) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 89/347 places, 116/672 transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-31 21:00:21] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[857, 857, 2]
RANDOM walk for 1000000 steps (229692 resets) in 2117 ms. (472 steps per ms)
BEST_FIRST walk for 3000001 steps (296817 resets) in 2833 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1] Max Struct:[857, 857, 2]
[2024-05-31 21:00:26] [INFO ] Invariant cache hit.
[2024-05-31 21:00:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:00:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:00:26] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:00:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:26] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:00:26] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:00:26] [INFO ] Computed and/alt/rep : 30/68/30 causal constraints (skipped 85 transitions) in 15 ms.
[2024-05-31 21:00:26] [INFO ] Added : 10 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 61 ms.
[2024-05-31 21:00:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:00:27] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2024-05-31 21:00:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:27] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:00:27] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:00:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:00:27] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 272 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1] Max Struct:[857, 1, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 116/116 transitions.
Graph (complete) has 279 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 86 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 84 transition count 107
Applied a total of 12 rules in 13 ms. Remains 84 /89 variables (removed 5) and now considering 107/116 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 84/89 places, 107/116 transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-31 21:00:27] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[857]
RANDOM walk for 1000000 steps (229723 resets) in 1867 ms. (535 steps per ms)
BEST_FIRST walk for 1000001 steps (99143 resets) in 862 ms. (1158 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[857]
[2024-05-31 21:00:30] [INFO ] Invariant cache hit.
[2024-05-31 21:00:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:00:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:00:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:00:30] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:00:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:00:30] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:00:30] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 9 ms.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:00:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 349 ms
[2024-05-31 21:00:30] [INFO ] Added : 17 causal constraints over 4 iterations in 409 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-31 21:00:30] [INFO ] Invariant cache hit.
[2024-05-31 21:00:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 21:00:31] [INFO ] Invariant cache hit.
[2024-05-31 21:00:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:00:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-31 21:00:31] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-31 21:00:31] [INFO ] Invariant cache hit.
[2024-05-31 21:00:31] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2078 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4024 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6275ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6623 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9221 resets) in 850 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3924 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3887 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
Probably explored full state space saw : 9453 states, properties seen :1
Probabilistic random walk after 22754 steps, saw 9453 distinct states, run finished after 134 ms. (steps per millisecond=169 ) properties seen :1
Explored full state space saw : 9469 states, properties seen :0
Exhaustive walk after 22770 steps, saw 9469 distinct states, run finished after 47 ms. (steps per millisecond=484 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[857]
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[857]
[2024-05-31 21:00:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[857]
RANDOM walk for 10000 steps (2292 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (1008 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[857]
[2024-05-31 21:00:38] [INFO ] Invariant cache hit.
[2024-05-31 21:00:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:00:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:00:38] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:00:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:00:38] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:00:38] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 8 ms.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:00:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2024-05-31 21:00:38] [INFO ] Added : 17 causal constraints over 4 iterations in 295 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/84 places, 107/107 transitions.
[2024-05-31 21:00:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[857]
RANDOM walk for 1000000 steps (229874 resets) in 2045 ms. (488 steps per ms)
BEST_FIRST walk for 1000000 steps (98660 resets) in 889 ms. (1123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[857]
[2024-05-31 21:00:41] [INFO ] Invariant cache hit.
[2024-05-31 21:00:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:00:41] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:00:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:00:41] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:00:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:00:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:00:41] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:00:41] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 10 ms.
[2024-05-31 21:00:41] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:00:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:00:42] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:00:42] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:00:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 251 ms
[2024-05-31 21:00:42] [INFO ] Added : 17 causal constraints over 4 iterations in 306 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-31 21:00:42] [INFO ] Invariant cache hit.
[2024-05-31 21:00:42] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:00:42] [INFO ] Invariant cache hit.
[2024-05-31 21:00:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:00:42] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-31 21:00:42] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-31 21:00:42] [INFO ] Invariant cache hit.
[2024-05-31 21:00:42] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1976 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3868 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5960ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6206 ms. Remains : 84/84 places, 107/107 transitions.
RANDOM walk for 40000 steps (9202 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3977 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3990 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Probably explored full state space saw : 9453 states, properties seen :1
Probabilistic random walk after 22754 steps, saw 9453 distinct states, run finished after 94 ms. (steps per millisecond=242 ) properties seen :1
Explored full state space saw : 9469 states, properties seen :0
Exhaustive walk after 22770 steps, saw 9469 distinct states, run finished after 29 ms. (steps per millisecond=785 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[857]
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-00 in 10577 ms.
[2024-05-31 21:00:48] [INFO ] Flatten gal took : 33 ms
[2024-05-31 21:00:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 21:00:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 107 transitions and 421 arcs took 4 ms.
Total runtime 35887 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d1m04-UpperBounds-00

BK_STOP 1717189249222

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d1m04-UpperBounds-00
ub formula formula --maxsum=/tmp/699/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

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

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