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

About the Execution of 2022-gold for SieveSingleMsgMbox-PT-d1m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4187.323 1245480.00 1269977.00 115.80 0 1 0 0 0 0 0 32 0 0 0 1 0 0 1 0 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r447-tajo-167905989500054.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is SieveSingleMsgMbox-PT-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r447-tajo-167905989500054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679573601660

Running Version 202205111006
[2023-03-23 12:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 12:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:13:23] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-23 12:13:23] [INFO ] Transformed 1295 places.
[2023-03-23 12:13:23] [INFO ] Transformed 749 transitions.
[2023-03-23 12:13:23] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-23 12:13:23] [INFO ] Computed 6 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
// Phase 1: matrix 749 rows 259 cols
[2023-03-23 12:13:23] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-23 12:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:24] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-23 12:13:24] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-23 12:13:24] [INFO ] [Nat]Added 587 Read/Feed constraints in 135 ms returned sat
[2023-03-23 12:13:24] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 6 ms to minimize.
[2023-03-23 12:13:24] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2023-03-23 12:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2023-03-23 12:13:24] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 137 ms.
[2023-03-23 12:13:25] [INFO ] Added : 18 causal constraints over 4 iterations in 420 ms. Result :sat
Minimization took 164 ms.
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-23 12:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Added 587 Read/Feed constraints in 96 ms returned sat
[2023-03-23 12:13:25] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 101 ms.
[2023-03-23 12:13:26] [INFO ] Added : 22 causal constraints over 5 iterations in 380 ms. Result :sat
Minimization took 342 ms.
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-23 12:13:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Added 587 Read/Feed constraints in 81 ms returned sat
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 1 ms to minimize.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 1 ms to minimize.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 1 ms to minimize.
[2023-03-23 12:13:27] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 0 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 1 ms to minimize.
[2023-03-23 12:13:28] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 1 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 0 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 0 ms to minimize.
[2023-03-23 12:13:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2512 ms
[2023-03-23 12:13:29] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 61 ms.
[2023-03-23 12:13:29] [INFO ] Added : 14 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : [1, 63, 1] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 415 place count 136 transition count 180
Iterating global reduction 2 with 44 rules applied. Total rules applied 459 place count 136 transition count 180
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 475 place count 136 transition count 164
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 500 place count 111 transition count 137
Iterating global reduction 3 with 25 rules applied. Total rules applied 525 place count 111 transition count 137
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 539 place count 111 transition count 123
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 546 place count 104 transition count 113
Iterating global reduction 4 with 7 rules applied. Total rules applied 553 place count 104 transition count 113
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 560 place count 97 transition count 106
Iterating global reduction 4 with 7 rules applied. Total rules applied 567 place count 97 transition count 106
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 571 place count 93 transition count 101
Iterating global reduction 4 with 4 rules applied. Total rules applied 575 place count 93 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 576 place count 93 transition count 100
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 579 place count 90 transition count 97
Iterating global reduction 5 with 3 rules applied. Total rules applied 582 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 584 place count 88 transition count 95
Iterating global reduction 5 with 2 rules applied. Total rules applied 586 place count 88 transition count 95
Applied a total of 586 rules in 90 ms. Remains 88 /259 variables (removed 171) and now considering 95/749 (removed 654) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/259 places, 95/749 transitions.
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:30] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224131 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103349 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103428 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 2) seen :0
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:32] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-23 12:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 12:13:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 12:13:32] [INFO ] [Nat]Added 37 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:13:32] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 5 ms.
[2023-03-23 12:13:32] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 12:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:32] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 12:13:32] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2023-03-23 12:13:32] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 16 ms.
[2023-03-23 12:13:32] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : [1, 36] Max seen :[0, 0]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 10 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 95/95 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 95/95 transitions.
Applied a total of 0 rules in 9 ms. Remains 88 /88 variables (removed 0) and now considering 95/95 (removed 0) transitions.
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:32] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:32] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 12:13:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-23 12:13:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:33] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/88 places, 95/95 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:33] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 12:13:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-23 12:13:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 12:13:33] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2023-03-23 12:13:33] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 5 ms.
[2023-03-23 12:13:33] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 95/95 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 94
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 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 83 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 83 transition count 88
Applied a total of 12 rules in 18 ms. Remains 83 /88 variables (removed 5) and now considering 88/95 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/88 places, 88/95 transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:33] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 224126 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103609 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 12:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 12:13:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2023-03-23 12:13:34] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 64 transitions) in 6 ms.
[2023-03-23 12:13:34] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:34] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:34] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 12:13:34] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-23 12:13:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 83 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:34] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 in 1848 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2224 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 1040 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 95 rows 88 cols
[2023-03-23 12:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:34] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-23 12:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-23 12:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 12:13:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 12:13:35] [INFO ] [Nat]Added 37 Read/Feed constraints in 10 ms returned sat
[2023-03-23 12:13:35] [INFO ] Computed and/alt/rep : 24/55/24 causal constraints (skipped 70 transitions) in 6 ms.
[2023-03-23 12:13:35] [INFO ] Added : 13 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 95/95 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 93
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 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 83 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 82 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 86
Applied a total of 15 rules in 42 ms. Remains 81 /88 variables (removed 7) and now considering 86/95 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/88 places, 86/95 transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-23 12:13:35] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224392 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103366 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 1) seen :0
// Phase 1: matrix 86 rows 81 cols
[2023-03-23 12:13:36] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 12:13:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:36] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-23 12:13:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 12:13:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-23 12:13:36] [INFO ] [Nat]Added 34 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:36] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-23 12:13:36] [INFO ] Added : 14 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-23 12:13:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:36] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 86 rows 81 cols
[2023-03-23 12:13:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-23 12:13:36] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-23 12:13:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 86 rows 81 cols
[2023-03-23 12:13:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:36] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 86/86 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 in 1990 ms.
[2023-03-23 12:13:37] [INFO ] Flatten gal took : 34 ms
[2023-03-23 12:13:37] [INFO ] Applying decomposition
[2023-03-23 12:13:37] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7735562286006781161.txt' '-o' '/tmp/graph7735562286006781161.bin' '-w' '/tmp/graph7735562286006781161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7735562286006781161.bin' '-l' '-1' '-v' '-w' '/tmp/graph7735562286006781161.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:13:37] [INFO ] Decomposing Gal with order
[2023-03-23 12:13:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:13:37] [INFO ] Removed a total of 89 redundant transitions.
[2023-03-23 12:13:37] [INFO ] Flatten gal took : 50 ms
[2023-03-23 12:13:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 8 ms.
[2023-03-23 12:13:37] [INFO ] Time to serialize gal into /tmp/UpperBounds3118844568397996483.gal : 6 ms
[2023-03-23 12:13:37] [INFO ] Time to serialize properties into /tmp/UpperBounds12666584705199185942.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3118844568397996483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12666584705199185942.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds12666584705199185942.prop.
Detected timeout of ITS tools.
[2023-03-23 12:33:41] [INFO ] Flatten gal took : 17 ms
[2023-03-23 12:33:41] [INFO ] Time to serialize gal into /tmp/UpperBounds195819330676862148.gal : 2 ms
[2023-03-23 12:33:41] [INFO ] Time to serialize properties into /tmp/UpperBounds4269213683978848491.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds195819330676862148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4269213683978848491.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...294
Loading property file /tmp/UpperBounds4269213683978848491.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,4.29709e+13,25.5537,477192,2,27758,5,2.5581e+06,6,0,449,2.67538e+06,0
Total reachable state count : 42970854026435

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 :0 <= p14 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m36-UpperBounds-01,0,25.6234,477192,1,0,7,2.5581e+06,9,1,686,2.67538e+06,4
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 :0 <= l960 <= 32
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 32 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m36-UpperBounds-07,0,25.6609,477192,1,0,8,2.5581e+06,10,1,786,2.67538e+06,5
Total runtime 1244173 ms.

BK_STOP 1679574847140

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r447-tajo-167905989500054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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