Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281605800103.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 gold2021
Input is SafeBus-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281605800103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 26K Apr 29 11:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 29 11:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 213K Apr 29 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Apr 29 11:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 75K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 259K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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 SafeBus-PT-10-UpperBounds-00
FORMULA_NAME SafeBus-PT-10-UpperBounds-01
FORMULA_NAME SafeBus-PT-10-UpperBounds-02
FORMULA_NAME SafeBus-PT-10-UpperBounds-03
FORMULA_NAME SafeBus-PT-10-UpperBounds-04
FORMULA_NAME SafeBus-PT-10-UpperBounds-05
FORMULA_NAME SafeBus-PT-10-UpperBounds-06
FORMULA_NAME SafeBus-PT-10-UpperBounds-07
FORMULA_NAME SafeBus-PT-10-UpperBounds-08
FORMULA_NAME SafeBus-PT-10-UpperBounds-09
FORMULA_NAME SafeBus-PT-10-UpperBounds-10
FORMULA_NAME SafeBus-PT-10-UpperBounds-11
FORMULA_NAME SafeBus-PT-10-UpperBounds-12
FORMULA_NAME SafeBus-PT-10-UpperBounds-13
FORMULA_NAME SafeBus-PT-10-UpperBounds-14
FORMULA_NAME SafeBus-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653209103406

Running Version 0
[2022-05-22 08:45:04] [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-05-22 08:45:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 08:45:05] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-05-22 08:45:05] [INFO ] Transformed 316 places.
[2022-05-22 08:45:05] [INFO ] Transformed 1631 transitions.
[2022-05-22 08:45:05] [INFO ] Parsed PT model containing 316 places and 1631 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:05] [INFO ] Computed 45 place invariants in 45 ms
FORMULA SafeBus-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :28
FORMULA SafeBus-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :25
[2022-05-22 08:45:05] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:05] [INFO ] Computed 45 place invariants in 19 ms
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 11 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-05-22 08:45:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:05] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:05] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-22 08:45:05] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:06] [INFO ] [Nat]Added 111 Read/Feed constraints in 95 ms returned sat
[2022-05-22 08:45:06] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 4 ms to minimize.
[2022-05-22 08:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2022-05-22 08:45:06] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 91 ms.
[2022-05-22 08:45:06] [INFO ] Added : 20 causal constraints over 4 iterations in 302 ms. Result :sat
Minimization took 276 ms.
[2022-05-22 08:45:07] [INFO ] [Real]Absence check using 24 positive place invariants in 7 ms returned unsat
[2022-05-22 08:45:07] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:07] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:07] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-22 08:45:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:07] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:07] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 9 ms returned sat
[2022-05-22 08:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:07] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-22 08:45:07] [INFO ] [Nat]Added 111 Read/Feed constraints in 108 ms returned sat
[2022-05-22 08:45:07] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2022-05-22 08:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2022-05-22 08:45:07] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 84 ms.
[2022-05-22 08:45:08] [INFO ] Added : 20 causal constraints over 4 iterations in 248 ms. Result :sat
Minimization took 208 ms.
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive place invariants in 4 ms returned unsat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned unsat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 2 ms returned unsat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:08] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10, 1, 1, 1, 1] Max seen :[7, 10, 9, 1, 1, 1, 1]
FORMULA SafeBus-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 94100 steps, including 1000 resets, run finished after 593 ms. (steps per millisecond=158 ) properties (out of 2) seen :13 could not realise parikh vector
Incomplete Parikh walk after 95900 steps, including 1000 resets, run finished after 553 ms. (steps per millisecond=173 ) properties (out of 2) seen :12 could not realise parikh vector
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 184 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:09] [INFO ] Computed 45 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4898 ms. (steps per millisecond=204 ) properties (out of 2) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1181 ms. (steps per millisecond=846 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1500 ms. (steps per millisecond=666 ) properties (out of 2) seen :10
[2022-05-22 08:45:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:17] [INFO ] Computed 45 place invariants in 10 ms
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using 24 positive place invariants in 8 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-22 08:45:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-22 08:45:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 84 ms returned sat
[2022-05-22 08:45:18] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2022-05-22 08:45:18] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 1 ms to minimize.
[2022-05-22 08:45:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 543 ms
[2022-05-22 08:45:18] [INFO ] [Real]Absence check using 24 positive place invariants in 15 ms returned sat
[2022-05-22 08:45:18] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 6 ms returned sat
[2022-05-22 08:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:18] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-22 08:45:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:19] [INFO ] [Nat]Absence check using 24 positive place invariants in 161 ms returned sat
[2022-05-22 08:45:19] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 160 ms returned sat
[2022-05-22 08:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:20] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2022-05-22 08:45:20] [INFO ] [Nat]Added 111 Read/Feed constraints in 124 ms returned sat
[2022-05-22 08:45:20] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 2 ms to minimize.
[2022-05-22 08:45:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2022-05-22 08:45:20] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 76 ms.
[2022-05-22 08:45:20] [INFO ] Added : 20 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : [9, 10] Max seen :[9, 9]
FORMULA SafeBus-PT-10-UpperBounds-00 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 94100 steps, including 1000 resets, run finished after 583 ms. (steps per millisecond=161 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 95 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:21] [INFO ] Computed 45 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4451 ms. (steps per millisecond=224 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties (out of 1) seen :9
[2022-05-22 08:45:27] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:27] [INFO ] Computed 45 place invariants in 8 ms
[2022-05-22 08:45:27] [INFO ] [Real]Absence check using 24 positive place invariants in 8 ms returned sat
[2022-05-22 08:45:27] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-22 08:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:28] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2022-05-22 08:45:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:28] [INFO ] [Nat]Absence check using 24 positive place invariants in 20 ms returned sat
[2022-05-22 08:45:28] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:28] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2022-05-22 08:45:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:28] [INFO ] [Nat]Added 111 Read/Feed constraints in 106 ms returned sat
[2022-05-22 08:45:28] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 1 ms to minimize.
[2022-05-22 08:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2022-05-22 08:45:29] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 96 ms.
[2022-05-22 08:45:29] [INFO ] Added : 20 causal constraints over 4 iterations in 344 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Incomplete Parikh walk after 94100 steps, including 1000 resets, run finished after 526 ms. (steps per millisecond=178 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 174 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 260 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2022-05-22 08:45:30] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2022-05-22 08:45:30] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-22 08:45:31] [INFO ] Implicit Places using invariants in 862 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 874 ms to find 10 implicit places.
[2022-05-22 08:45:31] [INFO ] Redundant transitions in 113 ms returned []
[2022-05-22 08:45:31] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:31] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-22 08:45:32] [INFO ] Dead Transitions using invariants and state equation in 571 ms returned [91, 102, 113, 124, 135, 146, 157, 168, 179, 190, 191, 202, 213, 224, 235, 246, 257, 268, 279, 290, 291, 302, 313, 324, 335, 346, 357, 368, 379, 390, 391, 402, 413, 424, 435, 446, 457, 468, 479, 490, 491, 502, 513, 524, 535, 546, 557, 568, 579, 590, 591, 602, 613, 624, 635, 646, 657, 668, 679, 690, 691, 702, 713, 724, 735, 746, 757, 768, 779, 790, 791, 802, 813, 824, 835, 846, 857, 868, 879, 890, 891, 902, 913, 924, 935, 946, 957, 968, 979, 990, 991, 1002, 1013, 1024, 1035, 1046, 1057, 1068, 1079, 1090]
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions :[1090, 1079, 1068, 1057, 1046, 1035, 1024, 1013, 1002, 991, 990, 979, 968, 957, 946, 935, 924, 913, 902, 891, 890, 879, 868, 857, 846, 835, 824, 813, 802, 791, 790, 779, 768, 757, 746, 735, 724, 713, 702, 691, 690, 679, 668, 657, 646, 635, 624, 613, 602, 591, 590, 579, 568, 557, 546, 535, 524, 513, 502, 491, 490, 479, 468, 457, 446, 435, 424, 413, 402, 391, 390, 379, 368, 357, 346, 335, 324, 313, 302, 291, 290, 279, 268, 257, 246, 235, 224, 213, 202, 191, 190, 179, 168, 157, 146, 135, 124, 113, 102, 91]
Starting structural reductions, iteration 1 : 296/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 289 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-22 08:45:32] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-22 08:45:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:32] [INFO ] Computed 35 place invariants in 11 ms
[2022-05-22 08:45:32] [INFO ] Dead Transitions using invariants and state equation in 473 ms returned []
Finished structural reductions, in 2 iterations. Remains : 296/306 places, 1531/1631 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:32] [INFO ] Computed 35 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4003 ms. (steps per millisecond=249 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 1) seen :9
[2022-05-22 08:45:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:38] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-22 08:45:38] [INFO ] [Real]Absence check using 14 positive place invariants in 68 ms returned sat
[2022-05-22 08:45:38] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-22 08:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:38] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-05-22 08:45:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:39] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2022-05-22 08:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:39] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-05-22 08:45:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:39] [INFO ] [Nat]Added 111 Read/Feed constraints in 77 ms returned sat
[2022-05-22 08:45:39] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 1 ms to minimize.
[2022-05-22 08:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-22 08:45:39] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 60 ms.
[2022-05-22 08:45:39] [INFO ] Added : 20 causal constraints over 4 iterations in 216 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Incomplete Parikh walk after 93200 steps, including 1000 resets, run finished after 454 ms. (steps per millisecond=205 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 84 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 76 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-22 08:45:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:40] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-22 08:45:41] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-05-22 08:45:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:41] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-22 08:45:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:42] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2022-05-22 08:45:42] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-22 08:45:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:42] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-22 08:45:44] [INFO ] Dead Transitions using invariants and state equation in 1051 ms returned []
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 1531/1531 transitions.
Starting property specific reduction for SafeBus-PT-10-UpperBounds-03
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:44] [INFO ] Computed 35 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :9
[2022-05-22 08:45:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:44] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-22 08:45:44] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:44] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:44] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-22 08:45:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:44] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-22 08:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:44] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2022-05-22 08:45:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 108 ms returned sat
[2022-05-22 08:45:44] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 1 ms to minimize.
[2022-05-22 08:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2022-05-22 08:45:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 66 ms.
[2022-05-22 08:45:45] [INFO ] Added : 20 causal constraints over 4 iterations in 322 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Incomplete Parikh walk after 93200 steps, including 1000 resets, run finished after 453 ms. (steps per millisecond=205 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 137 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:46] [INFO ] Computed 35 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4091 ms. (steps per millisecond=244 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1382 ms. (steps per millisecond=723 ) properties (out of 1) seen :9
[2022-05-22 08:45:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:51] [INFO ] Computed 35 place invariants in 11 ms
[2022-05-22 08:45:51] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:51] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 5 ms returned sat
[2022-05-22 08:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:51] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-05-22 08:45:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:51] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 18 ms returned sat
[2022-05-22 08:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:52] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-22 08:45:52] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:52] [INFO ] [Nat]Added 111 Read/Feed constraints in 96 ms returned sat
[2022-05-22 08:45:52] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 0 ms to minimize.
[2022-05-22 08:45:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2022-05-22 08:45:52] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 39 ms.
[2022-05-22 08:45:52] [INFO ] Added : 20 causal constraints over 4 iterations in 187 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Incomplete Parikh walk after 93200 steps, including 1000 resets, run finished after 477 ms. (steps per millisecond=195 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 133 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 76 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2022-05-22 08:45:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:53] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-22 08:45:53] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-05-22 08:45:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:53] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-22 08:45:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2022-05-22 08:45:55] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2022-05-22 08:45:55] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-22 08:45:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2022-05-22 08:45:55] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-22 08:45:56] [INFO ] Dead Transitions using invariants and state equation in 727 ms returned []
Finished structural reductions, in 1 iterations. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-PT-10-UpperBounds-03 in 12042 ms.
[2022-05-22 08:45:56] [INFO ] Flatten gal took : 366 ms
[2022-05-22 08:45:56] [INFO ] Applying decomposition
[2022-05-22 08:45:57] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph940617393669223541.txt, -o, /tmp/graph940617393669223541.bin, -w, /tmp/graph940617393669223541.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph940617393669223541.bin, -l, -1, -v, -w, /tmp/graph940617393669223541.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 08:45:57] [INFO ] Decomposing Gal with order
[2022-05-22 08:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 08:45:58] [INFO ] Removed a total of 3520 redundant transitions.
[2022-05-22 08:45:58] [INFO ] Flatten gal took : 526 ms
[2022-05-22 08:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 569 labels/synchronizations in 64 ms.
[2022-05-22 08:45:58] [INFO ] Time to serialize gal into /tmp/UpperBounds15394693036768686421.gal : 25 ms
[2022-05-22 08:45:58] [INFO ] Time to serialize properties into /tmp/UpperBounds6309091437912527565.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15394693036768686421.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6309091437912527565.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15394693036768686421.gal -t CGAL -reachable-file /tmp/UpperBounds6309091437912527565.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6309091437912527565.prop.
Detected timeout of ITS tools.
[2022-05-22 09:06:19] [INFO ] Flatten gal took : 1144 ms
[2022-05-22 09:06:19] [INFO ] Time to serialize gal into /tmp/UpperBounds2510985242791733635.gal : 216 ms
[2022-05-22 09:06:19] [INFO ] Time to serialize properties into /tmp/UpperBounds7995472906239904747.prop : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2510985242791733635.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7995472906239904747.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2510985242791733635.gal -t CGAL -reachable-file /tmp/UpperBounds7995472906239904747.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7995472906239904747.prop.
Detected timeout of ITS tools.
[2022-05-22 09:26:39] [INFO ] Flatten gal took : 1036 ms
[2022-05-22 09:26:41] [INFO ] Input system was already deterministic with 1531 transitions.
[2022-05-22 09:26:41] [INFO ] Transformed 296 places.
[2022-05-22 09:26:41] [INFO ] Transformed 1531 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 09:27:11] [INFO ] Time to serialize gal into /tmp/UpperBounds2836386269755103815.gal : 38 ms
[2022-05-22 09:27:11] [INFO ] Time to serialize properties into /tmp/UpperBounds2443998114583296702.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2836386269755103815.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2443998114583296702.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2836386269755103815.gal -t CGAL -reachable-file /tmp/UpperBounds2443998114583296702.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2443998114583296702.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SafeBus-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is SafeBus-PT-10, 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 r215-oct2-165281605800103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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