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.r196-tall-174889279200454.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 SafeBus-COL-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889279200454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748963044115

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-03 15:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:04:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 15:04:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 15:04:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2025-06-03 15:04:06] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2025-06-03 15:04:06] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 30 ms.
[2025-06-03 15:04:06] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2025-06-03 15:04:06] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-03 15:04:06] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 64 ms.
[2025-06-03 15:04:06] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-03 15:04:06] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 25 ms.
[2025-06-03 15:04:06] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2025-06-03 15:04:06] [INFO ] Reduced 80 identical enabling conditions.
[2025-06-03 15:04:06] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 0 ms.
[2025-06-03 15:04:06] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2025-06-03 15:04:06] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 27 ms.
[2025-06-03 15:04:06] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2025-06-03 15:04:06] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.21185KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 227 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 240 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 200 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 15:04:06] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 15:04:06] [INFO ] Computed 45 invariants in 46 ms
[2025-06-03 15:04:07] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-03 15:04:07] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 15:04:07] [INFO ] Invariant cache hit.
[2025-06-03 15:04:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:04:07] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2025-06-03 15:04:07] [INFO ] Redundant transitions in 145 ms returned []
Running 1621 sub problems to find dead transitions.
[2025-06-03 15:04:07] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-03 15:04:07] [INFO ] Invariant cache hit.
[2025-06-03 15:04:07] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 15:04:20] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 24 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 52 places in 291 ms of which 8 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 2 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2025-06-03 15:04:21] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2025-06-03 15:04:22] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2025-06-03 15:04:22] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2025-06-03 15:04:22] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2025-06-03 15:04:31] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2025-06-03 15:04:34] [INFO ] Deduced a trap composed of 34 places in 3150 ms of which 2 ms to minimize.
[2025-06-03 15:04:34] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 3 ms to minimize.
[2025-06-03 15:04:34] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 2 ms to minimize.
[2025-06-03 15:04:35] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2025-06-03 15:04:35] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2025-06-03 15:04:35] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2025-06-03 15:04:35] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2025-06-03 15:04:36] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2025-06-03 15:04:37] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 15:04:53] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2025-06-03 15:04:53] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2025-06-03 15:04:53] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-03 15:04:53] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 2 ms to minimize.
[2025-06-03 15:04:54] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2025-06-03 15:04:54] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2025-06-03 15:04:54] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2025-06-03 15:04:54] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:04:54] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2025-06-03 15:04:55] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2025-06-03 15:04:58] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:04:58] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 2 ms to minimize.
[2025-06-03 15:04:58] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 2 ms to minimize.
[2025-06-03 15:04:58] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 2 ms to minimize.
[2025-06-03 15:04:59] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 2 ms to minimize.
[2025-06-03 15:04:59] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 2 ms to minimize.
[2025-06-03 15:04:59] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 2 ms to minimize.
[2025-06-03 15:04:59] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 2 ms to minimize.
[2025-06-03 15:05:00] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 2 ms to minimize.
[2025-06-03 15:05:00] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2025-06-03 15:05:10] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2025-06-03 15:05:10] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2025-06-03 15:05:11] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 88 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 43/43 constraints]
After SMT, in 64337ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64370ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 95 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 15:05:11] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 65479 ms. Remains : 306/306 places, 1531/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5687 ms (no deadlock found). (steps per millisecond=219 )
Random directed walk for 1250000 steps, including 0 resets, run took 4259 ms (no deadlock found). (steps per millisecond=293 )
[2025-06-03 15:05:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:05:21] [INFO ] Invariant cache hit.
[2025-06-03 15:05:22] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2025-06-03 15:05:22] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 427 ms returned sat
[2025-06-03 15:05:23] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2025-06-03 15:05:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:05:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2025-06-03 15:05:23] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 20 ms returned sat
[2025-06-03 15:05:23] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2025-06-03 15:05:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:05:24] [INFO ] [Nat]Added 111 Read/Feed constraints in 492 ms returned sat
[2025-06-03 15:05:24] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2025-06-03 15:05:24] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:05:24] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:05:24] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2025-06-03 15:05:24] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-03 15:05:25] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-03 15:05:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1066 ms
[2025-06-03 15:05:25] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 95 ms.
[2025-06-03 15:05:25] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2025-06-03 15:05:25] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2025-06-03 15:05:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2025-06-03 15:05:26] [INFO ] Added : 1 causal constraints over 1 iterations in 570 ms. Result :sat
Parikh directed walk for 12900 steps, including 968 resets, run took 110 ms. (steps per millisecond=117 )
Random directed walk for 500000 steps, including 0 resets, run took 1686 ms (no deadlock found). (steps per millisecond=296 )
Random walk for 500000 steps, including 0 resets, run took 2202 ms (no deadlock found). (steps per millisecond=227 )
Random directed walk for 500000 steps, including 0 resets, run took 1660 ms (no deadlock found). (steps per millisecond=301 )
Random walk for 500000 steps, including 0 resets, run took 2175 ms (no deadlock found). (steps per millisecond=229 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 86 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-03 15:05:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:05:34] [INFO ] Invariant cache hit.
[2025-06-03 15:05:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 15:05:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:05:34] [INFO ] Invariant cache hit.
[2025-06-03 15:05:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:05:34] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2025-06-03 15:05:34] [INFO ] Redundant transitions in 61 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-03 15:05:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:05:34] [INFO ] Invariant cache hit.
[2025-06-03 15:05:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 15:05:46] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2025-06-03 15:05:46] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 5 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2025-06-03 15:05:47] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2025-06-03 15:05:56] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 2 ms to minimize.
[2025-06-03 15:05:56] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2025-06-03 15:05:57] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2025-06-03 15:05:57] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
[2025-06-03 15:05:57] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2025-06-03 15:05:57] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2025-06-03 15:05:57] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2025-06-03 15:05:58] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2025-06-03 15:05:58] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2025-06-03 15:05:59] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2025-06-03 15:05:59] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2025-06-03 15:05:59] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 15:06:19] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 1 ms to minimize.
[2025-06-03 15:06:19] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2025-06-03 15:06:19] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2025-06-03 15:06:19] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 1 ms to minimize.
[2025-06-03 15:06:20] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2025-06-03 15:06:20] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2025-06-03 15:06:20] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
[2025-06-03 15:06:20] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 2 ms to minimize.
[2025-06-03 15:06:23] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 2 ms to minimize.
[2025-06-03 15:06:23] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2025-06-03 15:06:23] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 2 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 2 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2025-06-03 15:06:24] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2025-06-03 15:06:36] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2025-06-03 15:06:36] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63562ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63578ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64024 ms. Remains : 306/306 places, 1531/1531 transitions.
Random walk for 1250000 steps, including 0 resets, run took 5530 ms (no deadlock found). (steps per millisecond=226 )
Random directed walk for 1250000 steps, including 0 resets, run took 4179 ms (no deadlock found). (steps per millisecond=299 )
[2025-06-03 15:06:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-03 15:06:47] [INFO ] Invariant cache hit.
[2025-06-03 15:06:47] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-06-03 15:06:48] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 443 ms returned sat
[2025-06-03 15:06:49] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2025-06-03 15:06:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:06:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2025-06-03 15:06:49] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 20 ms returned sat
[2025-06-03 15:06:49] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-03 15:06:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:06:50] [INFO ] [Nat]Added 111 Read/Feed constraints in 500 ms returned sat
[2025-06-03 15:06:50] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:06:50] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-03 15:06:50] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2025-06-03 15:06:50] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:06:50] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:06:51] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-03 15:06:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1031 ms
[2025-06-03 15:06:51] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 60 ms.
[2025-06-03 15:06:51] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2025-06-03 15:06:51] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2025-06-03 15:06:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2025-06-03 15:06:51] [INFO ] Added : 1 causal constraints over 1 iterations in 544 ms. Result :sat
Parikh directed walk for 12900 steps, including 953 resets, run took 87 ms. (steps per millisecond=148 )
Random directed walk for 500002 steps, including 0 resets, run took 1694 ms (no deadlock found). (steps per millisecond=295 )
Random walk for 500000 steps, including 0 resets, run took 2217 ms (no deadlock found). (steps per millisecond=225 )
Random directed walk for 500006 steps, including 0 resets, run took 1673 ms (no deadlock found). (steps per millisecond=298 )
Random walk for 500000 steps, including 0 resets, run took 2222 ms (no deadlock found). (steps per millisecond=225 )
[2025-06-03 15:07:00] [INFO ] Flatten gal took : 305 ms
[2025-06-03 15:07:00] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 34 ms.
[2025-06-03 15:07:00] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2025-06-03 15:07:00] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 20 transitions.
RANDOM walk for 1914 steps (0 resets) in 97 ms. (19 steps per ms) remains 0/13 properties
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 20 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 20 transitions.
Unable to solve all queries for examination Liveness. Remains :14 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 14 properties from file /home/mcc/execution/Liveness.xml in 12 ms.
Working with output stream class java.io.PrintStream
Total runtime 175043 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 20
TRANSITIONS: 14
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 5
ARCS: 68
LOADING TIME: 0.163

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 326
TRANSITIONS: 1651
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 11474
UNFOLDING TIME: 0.46

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.115
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.916
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 878
MODEL NAME: /home/mcc/execution/model
326 places, 1651 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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-COL-10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SafeBus-COL-10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r196-tall-174889279200454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;