Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r127-smll-177955743800032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-177955743800032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 7 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 09:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 460K Mar 3 18:30 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779568632976

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 20:37:15] [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]
[2026-05-23 20:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:37:15] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2026-05-23 20:37:15] [INFO ] Transformed 295 places.
[2026-05-23 20:37:15] [INFO ] Transformed 800 transitions.
[2026-05-23 20:37:15] [INFO ] Found NUPN structural information;
[2026-05-23 20:37:15] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 20:37:15] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2026-05-23 20:37:15] [INFO ] Computed 16 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 69 ms. (142 steps per ms)
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:37:15] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2026-05-23 20:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:37:16] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2026-05-23 20:37:16] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2026-05-23 20:37:16] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2026-05-23 20:37:16] [INFO ] State equation strengthened by 196 read => feed constraints.
[2026-05-23 20:37:16] [INFO ] [Real]Added 196 Read/Feed constraints in 47 ms returned sat
[2026-05-23 20:37:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:37:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 20:37:16] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2026-05-23 20:37:17] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2026-05-23 20:37:17] [INFO ] [Nat]Added 196 Read/Feed constraints in 41 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:21] [INFO ] Deduced a trap composed of 3 places in 3823 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:21] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:21] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:21] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 10 ms to minimize.
[2026-05-23 20:37:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 295 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p34_3_1) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 799/799 transitions.
Reduce places removed 1 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 294 transition count 791
Reduce places removed 7 places and 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 287 transition count 789
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 286 transition count 788
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 285 transition count 787
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 15 place count 285 transition count 709
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 171 place count 207 transition count 709
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 191 place count 187 transition count 609
Iterating global reduction 4 with 20 rules applied. Total rules applied 211 place count 187 transition count 609
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 251 place count 167 transition count 589
Applied a total of 251 rules in 248 ms. Remains 167 /295 variables (removed 128) and now considering 589/799 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 167/295 places, 589/799 transitions.
[2026-05-23 20:37:22] [INFO ] Flow matrix only has 255 transitions (discarded 334 similar events)
// Phase 1: matrix 255 rows 167 cols
[2026-05-23 20:37:22] [INFO ] Computed 16 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1620 ms. (616 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 524 ms. (1904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:37:24] [INFO ] Flow matrix only has 255 transitions (discarded 334 similar events)
[2026-05-23 20:37:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:37:24] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-23 20:37:24] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-23 20:37:24] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-23 20:37:24] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-23 20:37:24] [INFO ] [Real]Added 113 Read/Feed constraints in 26 ms returned sat
[2026-05-23 20:37:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:37:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-23 20:37:24] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-23 20:37:24] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-23 20:37:24] [INFO ] [Nat]Added 113 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
[2026-05-23 20:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2026-05-23 20:37:24] [INFO ] Computed and/alt/rep : 255/847/196 causal constraints (skipped 54 transitions) in 34 ms.
[2026-05-23 20:37:25] [INFO ] Added : 44 causal constraints over 9 iterations in 312 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 589/589 transitions.
Applied a total of 0 rules in 26 ms. Remains 167 /167 variables (removed 0) and now considering 589/589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 167/167 places, 589/589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 589/589 transitions.
Applied a total of 0 rules in 24 ms. Remains 167 /167 variables (removed 0) and now considering 589/589 (removed 0) transitions.
[2026-05-23 20:37:25] [INFO ] Flow matrix only has 255 transitions (discarded 334 similar events)
[2026-05-23 20:37:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:37:25] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-23 20:37:25] [INFO ] Flow matrix only has 255 transitions (discarded 334 similar events)
[2026-05-23 20:37:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:37:25] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-23 20:37:26] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:37:26] [INFO ] Redundant transitions in 50 ms returned []
Running 584 sub problems to find dead transitions.
[2026-05-23 20:37:26] [INFO ] Flow matrix only has 255 transitions (discarded 334 similar events)
[2026-05-23 20:37:26] [INFO ] Invariant cache hit.
[2026-05-23 20:37:26] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:30] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:31] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:31] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:31] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:32] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:32] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:33] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:33] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:33] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:33] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (OVERLAPS) 1/167 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:45] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:45] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:46] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:46] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:46] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:46] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:47] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:47] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:47] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:47] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:48] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:48] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:48] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:48] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:48] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:49] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:49] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:49] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:53] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:53] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:53] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:53] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:54] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:54] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:55] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:55] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:55] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:55] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:56] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:56] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:37:56] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/422 variables, and 61 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/167 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:00] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:00] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:00] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:01] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:01] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:01] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:01] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:02] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 1/167 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:14] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:14] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:14] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:14] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:14] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:15] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:15] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:15] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:15] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:15] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:16] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:16] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:22] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:25] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:38:26] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/422 variables, and 84 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/167 constraints, ReadFeed: 0/113 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61569 ms. Remains : 167/167 places, 589/589 transitions.
RANDOM walk for 40000 steps (8 resets) in 882 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 328 steps, run visited all 2 properties in 20 ms. (steps per millisecond=16 )
Probabilistic random walk after 328 steps, saw 267 distinct states, run finished after 25 ms. (steps per millisecond=13 ) properties seen :2
[2026-05-23 20:38:27] [INFO ] Flatten gal took : 145 ms
[2026-05-23 20:38:27] [INFO ] Flatten gal took : 63 ms
[2026-05-23 20:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2055872173196843990.gal : 32 ms
[2026-05-23 20:38:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14085220367039133729.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2055872173196843990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14085220367039133729.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 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 72737 ms.

BK_STOP 1779568707900

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is EisenbergMcGuire-PT-05, 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 r127-smll-177955743800032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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