Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654951172738

Running Version 202205111006
[2022-06-11 12:39:33] [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]
[2022-06-11 12:39:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:39:34] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2022-06-11 12:39:34] [INFO ] Transformed 1295 places.
[2022-06-11 12:39:34] [INFO ] Transformed 749 transitions.
[2022-06-11 12:39:34] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 12:39:34] [INFO ] Computed 6 place invariants in 32 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 980 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 966 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 12:39:34] [INFO ] Computed 6 place invariants in 13 ms
[2022-06-11 12:39:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 12:39:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 12:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:34] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-06-11 12:39:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:39:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:35] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-11 12:39:35] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-11 12:39:35] [INFO ] [Nat]Added 587 Read/Feed constraints in 78 ms returned sat
[2022-06-11 12:39:35] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2022-06-11 12:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-06-11 12:39:35] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 146 ms.
[2022-06-11 12:39:35] [INFO ] Added : 17 causal constraints over 4 iterations in 500 ms. Result :sat
Minimization took 105 ms.
[2022-06-11 12:39:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:39:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:36] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-11 12:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:39:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:36] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-11 12:39:36] [INFO ] [Nat]Added 587 Read/Feed constraints in 90 ms returned sat
[2022-06-11 12:39:36] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2022-06-11 12:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-06-11 12:39:36] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 86 ms.
[2022-06-11 12:39:36] [INFO ] Added : 17 causal constraints over 4 iterations in 350 ms. Result :sat
Minimization took 124 ms.
[2022-06-11 12:39:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:39:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:37] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-06-11 12:39:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:39:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:37] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-11 12:39:37] [INFO ] [Nat]Added 587 Read/Feed constraints in 153 ms returned sat
[2022-06-11 12:39:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 66 ms.
[2022-06-11 12:39:38] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2022-06-11 12:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-06-11 12:39:38] [INFO ] Added : 24 causal constraints over 6 iterations in 630 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 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 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 231
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 225
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 412 place count 138 transition count 182
Iterating global reduction 2 with 43 rules applied. Total rules applied 455 place count 138 transition count 182
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 469 place count 138 transition count 168
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 495 place count 112 transition count 140
Iterating global reduction 3 with 26 rules applied. Total rules applied 521 place count 112 transition count 140
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 536 place count 112 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 542 place count 106 transition count 117
Iterating global reduction 4 with 6 rules applied. Total rules applied 548 place count 106 transition count 117
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 554 place count 100 transition count 111
Iterating global reduction 4 with 6 rules applied. Total rules applied 560 place count 100 transition count 111
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 563 place count 97 transition count 107
Iterating global reduction 4 with 3 rules applied. Total rules applied 566 place count 97 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 567 place count 97 transition count 106
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 570 place count 94 transition count 103
Iterating global reduction 5 with 3 rules applied. Total rules applied 573 place count 94 transition count 103
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 575 place count 92 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 577 place count 92 transition count 101
Applied a total of 577 rules in 76 ms. Remains 92 /259 variables (removed 167) and now considering 101/749 (removed 648) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/259 places, 101/749 transitions.
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:38] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224404 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103864 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103533 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 2) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:40] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:39:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-11 12:39:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:40] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2022-06-11 12:39:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2022-06-11 12:39:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-11 12:39:40] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-11 12:39:40] [INFO ] Added : 22 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 20 ms.
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:39:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 12:39:40] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2022-06-11 12:39:40] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 7 ms.
[2022-06-11 12:39:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2022-06-11 12:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2022-06-11 12:39:41] [INFO ] Added : 15 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 29] Max seen :[0, 0]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 101/101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:39:41] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:39:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:41] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-06-11 12:39:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:39:41] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 101/101 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1054 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:39:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 12:39:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:41] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:39:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:41] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2022-06-11 12:39:41] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-06-11 12:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-11 12:39:41] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-11 12:39:41] [INFO ] Added : 22 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 92/92 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 100
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 91 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 90 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 90 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 89 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 88 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 87 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 87 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 86 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 86 transition count 92
Applied a total of 15 rules in 22 ms. Remains 86 /92 variables (removed 6) and now considering 92/101 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/92 places, 92/101 transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:39:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224242 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103715 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:39:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:39:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:39:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 12:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:39:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:39:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 12:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:42] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-11 12:39:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:39:42] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:39:43] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 5 ms.
[2022-06-11 12:39:43] [INFO ] Added : 21 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:39:43] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:39:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:39:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-06-11 12:39:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:39:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 in 1943 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-15
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1056 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:39:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:39:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:39:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 12:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:39:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 12:39:43] [INFO ] [Nat]Added 39 Read/Feed constraints in 9 ms returned sat
[2022-06-11 12:39:43] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 7 ms.
[2022-06-11 12:39:43] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2022-06-11 12:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-11 12:39:43] [INFO ] Added : 15 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 92/92 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 90 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 90 transition count 99
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 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 89 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 88 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 83 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 82 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 82 transition count 88
Applied a total of 21 rules in 16 ms. Remains 82 /92 variables (removed 10) and now considering 88/101 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/92 places, 88/101 transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-11 12:39:43] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224173 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 104030 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2022-06-11 12:39:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:39:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:39:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:39:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:39:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:39:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:39:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:39:44] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-11 12:39:44] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2022-06-11 12:39:44] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 5 ms.
[2022-06-11 12:39:44] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-06-11 12:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-11 12:39:44] [INFO ] Added : 16 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-11 12:39:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:39:45] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-11 12:39:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:39:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-11 12:39:45] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-11 12:39:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-11 12:39:45] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-11 12:39:45] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 in 1926 ms.
[2022-06-11 12:39:45] [INFO ] Flatten gal took : 35 ms
[2022-06-11 12:39:45] [INFO ] Applying decomposition
[2022-06-11 12:39:45] [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/graph12394108805725682851.txt' '-o' '/tmp/graph12394108805725682851.bin' '-w' '/tmp/graph12394108805725682851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12394108805725682851.bin' '-l' '-1' '-v' '-w' '/tmp/graph12394108805725682851.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:39:45] [INFO ] Decomposing Gal with order
[2022-06-11 12:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:39:45] [INFO ] Removed a total of 98 redundant transitions.
[2022-06-11 12:39:45] [INFO ] Flatten gal took : 43 ms
[2022-06-11 12:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 7 ms.
[2022-06-11 12:39:45] [INFO ] Time to serialize gal into /tmp/UpperBounds16943262946865354825.gal : 5 ms
[2022-06-11 12:39:45] [INFO ] Time to serialize properties into /tmp/UpperBounds7719640411480008958.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/UpperBounds16943262946865354825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7719640411480008958.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/UpperBounds7719640411480008958.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,71729,0.336544,17096,917,200,22867,1083,320,62204,75,6368,0
Total reachable state count : 71729

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 :0 <= i4.u12.p22 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-03,0,0.35313,17096,1,0,22867,1083,430,62204,95,6368,993
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 :0 <= i7.u19.p72 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-15,0,0.354307,17096,1,0,22867,1083,455,62204,95,6368,1106
Total runtime 12103 ms.

BK_STOP 1654951186063

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-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 r312-tall-165472282900901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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