fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814480900253
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DBSingleClientW-PT-d1m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.020 19139.00 34614.00 351.20 0 0 1 0 0 0 1 0 1 0 0 0 0 0 2 0 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678266096016

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 09:01:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 09:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:01:37] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-08 09:01:37] [INFO ] Transformed 1440 places.
[2023-03-08 09:01:37] [INFO ] Transformed 672 transitions.
[2023-03-08 09:01:37] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 09:01:37] [INFO ] Computed 6 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :2
[2023-03-08 09:01:38] [INFO ] Invariant cache hit.
[2023-03-08 09:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 09:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 09:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:38] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-08 09:01:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-08 09:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 09:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:38] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-08 09:01:38] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 09:01:39] [INFO ] [Nat]Added 418 Read/Feed constraints in 78 ms returned sat
[2023-03-08 09:01:39] [INFO ] Deduced a trap composed of 108 places in 283 ms of which 4 ms to minimize.
[2023-03-08 09:01:39] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 1 ms to minimize.
[2023-03-08 09:01:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
[2023-03-08 09:01:39] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 117 ms.
[2023-03-08 09:01:39] [INFO ] Added : 4 causal constraints over 1 iterations in 221 ms. Result :sat
Minimization took 88 ms.
[2023-03-08 09:01:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 09:01:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 09:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:40] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-08 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 09:01:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:40] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-08 09:01:40] [INFO ] [Nat]Added 418 Read/Feed constraints in 78 ms returned sat
[2023-03-08 09:01:40] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 58 ms.
[2023-03-08 09:01:40] [INFO ] Added : 11 causal constraints over 3 iterations in 262 ms. Result :sat
Minimization took 106 ms.
[2023-03-08 09:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 09:01:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned unsat
[2023-03-08 09:01:41] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 09:01:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 09:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:41] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 09:01:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 09:01:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 09:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:41] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-08 09:01:41] [INFO ] [Nat]Added 418 Read/Feed constraints in 59 ms returned sat
[2023-03-08 09:01:41] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 57 ms.
[2023-03-08 09:01:41] [INFO ] Added : 2 causal constraints over 1 iterations in 148 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [1257, 7, 1, 8] Max seen :[0, 0, 1, 1]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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 removed 8 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 326 transition count 585
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 96 rules applied. Total rules applied 280 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 284 place count 230 transition count 324
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 357 place count 157 transition count 251
Iterating global reduction 2 with 73 rules applied. Total rules applied 430 place count 157 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 157 transition count 245
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 478 place count 115 transition count 177
Iterating global reduction 3 with 42 rules applied. Total rules applied 520 place count 115 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 115 transition count 154
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 555 place count 103 transition count 135
Iterating global reduction 4 with 12 rules applied. Total rules applied 567 place count 103 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 569 place count 103 transition count 133
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 578 place count 94 transition count 124
Iterating global reduction 5 with 9 rules applied. Total rules applied 587 place count 94 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 590 place count 94 transition count 121
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 597 place count 87 transition count 114
Iterating global reduction 6 with 7 rules applied. Total rules applied 604 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 607 place count 87 transition count 111
Applied a total of 607 rules in 87 ms. Remains 87 /347 variables (removed 260) and now considering 111/672 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 87/347 places, 111/672 transitions.
// Phase 1: matrix 111 rows 87 cols
[2023-03-08 09:01:41] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229775 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98775 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98951 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98971 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 3) seen :3
[2023-03-08 09:01:44] [INFO ] Invariant cache hit.
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 09:01:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 09:01:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:01:44] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-08 09:01:44] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 80 transitions) in 5 ms.
[2023-03-08 09:01:44] [INFO ] Added : 10 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 24 ms.
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 09:01:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 09:01:44] [INFO ] [Nat]Added 39 Read/Feed constraints in 5 ms returned sat
[2023-03-08 09:01:44] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 80 transitions) in 7 ms.
[2023-03-08 09:01:44] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1, 7, 8] Max seen :[1, 0, 2]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 111/111 transitions.
Graph (complete) has 271 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 85 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 85 transition count 108
Applied a total of 4 rules in 13 ms. Remains 85 /87 variables (removed 2) and now considering 108/111 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 85/87 places, 108/111 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 09:01:44] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229665 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98634 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98749 resets, run finished after 442 ms. (steps per millisecond=2262 ) properties (out of 2) seen :2
[2023-03-08 09:01:46] [INFO ] Invariant cache hit.
[2023-03-08 09:01:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 09:01:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 09:01:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-08 09:01:46] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 09:01:46] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 24 ms.
[2023-03-08 09:01:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 09:01:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:46] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-08 09:01:46] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-08 09:01:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-08 09:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 09:01:46] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 09:01:46] [INFO ] Added : 13 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [7, 8] Max seen :[0, 2]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
[2023-03-08 09:01:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
[2023-03-08 09:01:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:47] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-08 09:01:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
[2023-03-08 09:01:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
[2023-03-08 09:01:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 09:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 09:01:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:47] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 09:01:47] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 09:01:47] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 108/108 transitions.
[2023-03-08 09:01:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229720 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 99560 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :0
[2023-03-08 09:01:48] [INFO ] Invariant cache hit.
[2023-03-08 09:01:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 09:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 09:01:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:48] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-08 09:01:48] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2023-03-08 09:01:49] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 09:01:49] [INFO ] Invariant cache hit.
[2023-03-08 09:01:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 09:01:49] [INFO ] Invariant cache hit.
[2023-03-08 09:01:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 09:01:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:01:49] [INFO ] Invariant cache hit.
[2023-03-08 09:01:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 2030 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
[2023-03-08 09:01:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-08 09:01:49] [INFO ] Invariant cache hit.
[2023-03-08 09:01:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-08 09:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:49] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 09:01:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 09:01:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-08 09:01:49] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 09:01:49] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 82 transition count 99
Applied a total of 7 rules in 11 ms. Remains 82 /85 variables (removed 3) and now considering 99/108 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/85 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-08 09:01:49] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229541 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98254 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :2
[2023-03-08 09:01:50] [INFO ] Invariant cache hit.
[2023-03-08 09:01:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 09:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 09:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 09:01:50] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 09:01:50] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2023-03-08 09:01:50] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-03-08 09:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 09:01:50] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2023-03-08 09:01:50] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 09:01:50] [INFO ] Invariant cache hit.
[2023-03-08 09:01:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 09:01:51] [INFO ] Invariant cache hit.
[2023-03-08 09:01:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 09:01:51] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-08 09:01:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:01:51] [INFO ] Invariant cache hit.
[2023-03-08 09:01:51] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 82/82 places, 99/99 transitions.
[2023-03-08 09:01:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229650 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98585 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 1) seen :2
[2023-03-08 09:01:52] [INFO ] Invariant cache hit.
[2023-03-08 09:01:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 09:01:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:01:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 09:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:01:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 09:01:52] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 09:01:52] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2023-03-08 09:01:52] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2023-03-08 09:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-08 09:01:52] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2023-03-08 09:01:52] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 09:01:52] [INFO ] Invariant cache hit.
[2023-03-08 09:01:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 09:01:52] [INFO ] Invariant cache hit.
[2023-03-08 09:01:52] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 09:01:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-08 09:01:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:01:52] [INFO ] Invariant cache hit.
[2023-03-08 09:01:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 3574 ms.
[2023-03-08 09:01:53] [INFO ] Flatten gal took : 36 ms
[2023-03-08 09:01:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 09:01:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 108 transitions and 425 arcs took 2 ms.
Total runtime 15571 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/610/ub_0_ --maxsum=/tmp/610/ub_1_
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678266115155

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DBSingleClientW-PT-d1m06-UpperBounds-06
ub formula formula --maxsum=/tmp/610/ub_0_
ub formula name DBSingleClientW-PT-d1m06-UpperBounds-14
ub formula formula --maxsum=/tmp/610/ub_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 85 places, 108 transitions and 425 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d1m06 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 108->101 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 85; there are 101 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 101070 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.820 real 3.260 user 0.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 478508 states, 13802 nodes
pnml2lts-sym: Maximum sum of /tmp/610/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/610/ub_1_ is: 2
pnml2lts-sym: group_next: 1382 nodes total
pnml2lts-sym: group_explored: 1761 nodes, 1825 short vectors total
pnml2lts-sym: max token count: 6

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-d1m06"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d1m06, 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 r105-tall-167814480900253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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