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.r425-tajo-167905978200445.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 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-d1m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679317497021

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=SieveSingleMsgMbox-PT-d1m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 13:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:04:58] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-20 13:04:58] [INFO ] Transformed 1295 places.
[2023-03-20 13:04:58] [INFO ] Transformed 749 transitions.
[2023-03-20 13:04:58] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 13:04:59] [INFO ] Computed 6 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 2203 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 966 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
[2023-03-20 13:04:59] [INFO ] Invariant cache hit.
[2023-03-20 13:04:59] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 13:04:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:04:59] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-20 13:04:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:04:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:04:59] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:04:59] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-20 13:05:00] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 13:05:00] [INFO ] [Nat]Added 587 Read/Feed constraints in 150 ms returned sat
[2023-03-20 13:05:00] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 5 ms to minimize.
[2023-03-20 13:05:00] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 1 ms to minimize.
[2023-03-20 13:05:00] [INFO ] Deduced a trap composed of 168 places in 109 ms of which 0 ms to minimize.
[2023-03-20 13:05:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 571 ms
[2023-03-20 13:05:00] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 143 ms.
[2023-03-20 13:05:01] [INFO ] Added : 18 causal constraints over 4 iterations in 439 ms. Result :sat
Minimization took 176 ms.
[2023-03-20 13:05:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:05:01] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:01] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2023-03-20 13:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:05:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-20 13:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:01] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-20 13:05:02] [INFO ] [Nat]Added 587 Read/Feed constraints in 96 ms returned sat
[2023-03-20 13:05:02] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2023-03-20 13:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-20 13:05:02] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 130 ms.
[2023-03-20 13:05:02] [INFO ] Added : 14 causal constraints over 3 iterations in 379 ms. Result :sat
Minimization took 96 ms.
[2023-03-20 13:05:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:05:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 13:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:03] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-20 13:05:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:05:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:03] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-20 13:05:03] [INFO ] [Nat]Added 587 Read/Feed constraints in 152 ms returned sat
[2023-03-20 13:05:03] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 101 ms.
[2023-03-20 13:05:03] [INFO ] Added : 10 causal constraints over 2 iterations in 295 ms. Result :sat
Minimization took 449 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 123] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.3 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 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 416 place count 135 transition count 179
Iterating global reduction 2 with 45 rules applied. Total rules applied 461 place count 135 transition count 179
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 477 place count 135 transition count 163
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 503 place count 109 transition count 135
Iterating global reduction 3 with 26 rules applied. Total rules applied 529 place count 109 transition count 135
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 545 place count 109 transition count 119
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 552 place count 102 transition count 109
Iterating global reduction 4 with 7 rules applied. Total rules applied 559 place count 102 transition count 109
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 566 place count 95 transition count 102
Iterating global reduction 4 with 7 rules applied. Total rules applied 573 place count 95 transition count 102
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 577 place count 91 transition count 98
Iterating global reduction 4 with 4 rules applied. Total rules applied 581 place count 91 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 583 place count 91 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 587 place count 87 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 591 place count 87 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 593 place count 85 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 595 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 596 place count 84 transition count 88
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 598 place count 83 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 83 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 600 place count 82 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 82 transition count 86
Applied a total of 601 rules in 88 ms. Remains 82 /259 variables (removed 177) and now considering 86/749 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 82/259 places, 86/749 transitions.
// Phase 1: matrix 86 rows 82 cols
[2023-03-20 13:05:05] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224389 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103673 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103591 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 2) seen :0
[2023-03-20 13:05:06] [INFO ] Invariant cache hit.
[2023-03-20 13:05:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-20 13:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-20 13:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:06] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-20 13:05:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 7 ms returned sat
[2023-03-20 13:05:07] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 6 ms.
[2023-03-20 13:05:07] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 11 ms.
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-20 13:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2023-03-20 13:05:07] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-20 13:05:07] [INFO ] Added : 13 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1, 96] Max seen :[0, 1]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-20 13:05:07] [INFO ] Invariant cache hit.
[2023-03-20 13:05:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 13:05:07] [INFO ] Invariant cache hit.
[2023-03-20 13:05:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:07] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-20 13:05:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:05:07] [INFO ] Invariant cache hit.
[2023-03-20 13:05:07] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 82/82 places, 86/86 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-00
[2023-03-20 13:05:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 978 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 13:05:07] [INFO ] Invariant cache hit.
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:07] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-20 13:05:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:08] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-20 13:05:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 8 ms returned sat
[2023-03-20 13:05:08] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 7 ms.
[2023-03-20 13:05:08] [INFO ] Added : 11 causal constraints over 3 iterations in 130 ms. Result :sat
Minimization took 11 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 REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 86/86 transitions.
[2023-03-20 13:05:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224387 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103579 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 1) seen :0
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
[2023-03-20 13:05:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-20 13:05:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-20 13:05:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 7 ms returned sat
[2023-03-20 13:05:09] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-20 13:05:09] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 11 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 REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 29 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 82/82 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
[2023-03-20 13:05:09] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
[2023-03-20 13:05:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-20 13:05:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
[2023-03-20 13:05:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 82/82 places, 86/86 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-00 in 2178 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-04
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-20 13:05:09] [INFO ] Invariant cache hit.
[2023-03-20 13:05:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:05:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-20 13:05:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 13:05:10] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2023-03-20 13:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:10] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-20 13:05:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2023-03-20 13:05:10] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 4 ms.
[2023-03-20 13:05:10] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [96] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 79 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 78 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 77 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 77 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 76 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 76 transition count 79
Applied a total of 12 rules in 14 ms. Remains 76 /82 variables (removed 6) and now considering 79/86 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 76/82 places, 79/86 transitions.
// Phase 1: matrix 79 rows 76 cols
[2023-03-20 13:05:10] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224565 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103894 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 1) seen :0
[2023-03-20 13:05:11] [INFO ] Invariant cache hit.
[2023-03-20 13:05:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-20 13:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-20 13:05:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:05:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:05:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:05:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-20 13:05:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 13:05:11] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-20 13:05:11] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 58 transitions) in 5 ms.
[2023-03-20 13:05:11] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [96] Max seen :[0]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 76/76 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-20 13:05:11] [INFO ] Invariant cache hit.
[2023-03-20 13:05:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 13:05:11] [INFO ] Invariant cache hit.
[2023-03-20 13:05:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 13:05:11] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-20 13:05:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:05:11] [INFO ] Invariant cache hit.
[2023-03-20 13:05:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 76/76 places, 79/79 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-04 in 1896 ms.
[2023-03-20 13:05:12] [INFO ] Flatten gal took : 35 ms
[2023-03-20 13:05:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-20 13:05:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 86 transitions and 342 arcs took 1 ms.
Total runtime 13340 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/590/ub_0_ --maxsum=/tmp/590/ub_1_
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 1612132 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16093884 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-UpperBounds-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-UpperBounds-04

BK_STOP 1679321083482

--------------------
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 SieveSingleMsgMbox-PT-d1m96-UpperBounds-00
ub formula formula --maxsum=/tmp/590/ub_0_
ub formula name SieveSingleMsgMbox-PT-d1m96-UpperBounds-04
ub formula formula --maxsum=/tmp/590/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 82 places, 86 transitions and 342 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d1m96 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 86->84 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 82; there are 84 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 596
Killing (9) : 596

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-d1m96"
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 SieveSingleMsgMbox-PT-d1m96, 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 r425-tajo-167905978200445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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