Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349600023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is CopsAndRobbers-PT-CRL015X005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349600023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.7K Jun 6 09:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 08:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Jun 6 08:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Jun 6 11:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 11:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 6 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Jun 6 09:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 83K Jun 5 20:08 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

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

=== Now, execution of the tool begins

BK_START 1749318806174

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL015X005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:53:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:53:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:27] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2025-06-07 17:53:27] [INFO ] Transformed 85 places.
[2025-06-07 17:53:27] [INFO ] Transformed 109 transitions.
[2025-06-07 17:53:27] [INFO ] Parsed PT model containing 85 places and 109 transitions and 504 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 109 rows 85 cols
[2025-06-07 17:53:27] [INFO ] Computed 19 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 1, 5, 5, 1, 5, 5, 5, 5, 5, 1, 5, 5, 1]
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10001 steps (2 resets) in 28 ms. (344 steps per ms)
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (16 resets) in 81 ms. (731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 1] Max Struct:[5, 5, 5, 5, 5, 5]
[2025-06-07 17:53:27] [INFO ] Invariant cache hit.
[2025-06-07 17:53:27] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2025-06-07 17:53:27] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:27] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-07 17:53:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-07 17:53:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-07 17:53:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-06-07 17:53:28] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 13 ms.
[2025-06-07 17:53:28] [INFO ] Added : 41 causal constraints over 9 iterations in 192 ms. Result :sat
Minimization took 54 ms.
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-07 17:53:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:53:28] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 10 ms.
[2025-06-07 17:53:28] [INFO ] Added : 43 causal constraints over 10 iterations in 169 ms. Result :sat
Minimization took 49 ms.
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Real]Added 30 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:53:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-07 17:53:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:53:28] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 7 ms.
[2025-06-07 17:53:29] [INFO ] Added : 14 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 46 ms.
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-06-07 17:53:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:53:29] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 7 ms.
[2025-06-07 17:53:29] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 21 ms.
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Added 30 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:53:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:53:29] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 7 ms.
[2025-06-07 17:53:29] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 21 ms.
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using 18 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Real]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-06-07 17:53:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using 18 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-07 17:53:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2025-06-07 17:53:29] [INFO ] Computed and/alt/rep : 75/240/75 causal constraints (skipped 4 transitions) in 16 ms.
[2025-06-07 17:53:29] [INFO ] Added : 27 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 1] Max Struct:[5, 5, 5, 5, 5, 5]
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 1, 0] Max Struct:[5, 5, 5]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Graph (complete) has 370 edges and 85 vertex of which 73 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 73 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 71 transition count 107
Applied a total of 5 rules in 60 ms. Remains 71 /85 variables (removed 14) and now considering 107/109 (removed 2) transitions.
Running 77 sub problems to find dead transitions.
// Phase 1: matrix 107 rows 71 cols
[2025-06-07 17:53:30] [INFO ] Computed 18 invariants in 7 ms
[2025-06-07 17:53:30] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 107/175 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 3/178 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 119 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 107/175 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 65/181 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/178 variables, and 181 constraints, problems are : Problem set: 0 solved, 77 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/71 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 65/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 22895ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 22916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23005 ms. Remains : 71/85 places, 107/109 transitions.
[2025-06-07 17:53:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 1, 0] Max Struct:[5, 5, 5]
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000001 steps (2 resets) in 691 ms. (1445 steps per ms)
BEST_FIRST walk for 2000001 steps (7 resets) in 1257 ms. (1589 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[5, 5]
[2025-06-07 17:53:54] [INFO ] Invariant cache hit.
[2025-06-07 17:53:54] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:54] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-07 17:53:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-07 17:53:54] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:53:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2025-06-07 17:53:55] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 9 ms to minimize.
[2025-06-07 17:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-07 17:53:55] [INFO ] Computed and/alt/rep : 45/135/45 causal constraints (skipped 32 transitions) in 9 ms.
[2025-06-07 17:53:55] [INFO ] Added : 4 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 43 ms.
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Real]Added 30 Read/Feed constraints in 2 ms returned sat
[2025-06-07 17:53:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 17:53:55] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:53:55] [INFO ] Computed and/alt/rep : 45/135/45 causal constraints (skipped 32 transitions) in 7 ms.
[2025-06-07 17:53:55] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[5, 5]
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 107/107 transitions.
Graph (complete) has 332 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 69 /71 variables (removed 2) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 69/71 places, 107/107 transitions.
// Phase 1: matrix 107 rows 69 cols
[2025-06-07 17:53:55] [INFO ] Computed 18 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000001 steps (3 resets) in 562 ms. (1776 steps per ms)
BEST_FIRST walk for 1000001 steps (3 resets) in 568 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2025-06-07 17:53:56] [INFO ] Invariant cache hit.
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-07 17:53:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-07 17:53:56] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:53:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-07 17:53:56] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2025-06-07 17:53:56] [INFO ] Computed and/alt/rep : 45/135/45 causal constraints (skipped 32 transitions) in 6 ms.
[2025-06-07 17:53:56] [INFO ] Added : 16 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 69/69 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-06-07 17:53:56] [INFO ] Invariant cache hit.
[2025-06-07 17:53:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 17:53:56] [INFO ] Invariant cache hit.
[2025-06-07 17:53:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-07 17:53:57] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2025-06-07 17:53:57] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2025-06-07 17:53:57] [INFO ] Invariant cache hit.
[2025-06-07 17:53:57] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 107/175 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 117 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2509 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 107/175 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 73/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/176 variables, and 189 constraints, problems are : Problem set: 0 solved, 77 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 73/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 32554ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 32556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32837 ms. Remains : 69/69 places, 107/107 transitions.
RANDOM walk for 40000 steps (8 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 227 ms. (175 steps per ms) remains 1/2 properties
[2025-06-07 17:54:30] [INFO ] Invariant cache hit.
[2025-06-07 17:54:30] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/93 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/109 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 67/176 variables, 58/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 30/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/176 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/77 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-07 17:54:30] [INFO ] Flatten gal took : 67 ms
[2025-06-07 17:54:30] [INFO ] Flatten gal took : 31 ms
At refinement iteration 8 (OVERLAPS) 16/93 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/109 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/176 variables, 58/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-07 17:54:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9216863616762727025.gal : 23 ms
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-07 17:54:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3618886499647687187.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9216863616762727025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3618886499647687187.prop' '--nowitness' '--gen-order' 'FOLLOW'

At refinement iteration 16 (OVERLAPS) 0/176 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 9 ms.
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
FORMULA CopsAndRobbers-PT-CRL015X005-UpperBounds-07 5 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 63629 ms.

BK_STOP 1749318871095

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CopsAndRobbers-PT-CRL015X005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CopsAndRobbers-PT-CRL015X005, 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 r265-tall-174931349600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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