Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r447-tajo-167905989500057.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is SieveSingleMsgMbox-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r447-tajo-167905989500057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679573606333

Running Version 202205111006
[2023-03-23 12:13:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 12:13:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:13:28] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-23 12:13:28] [INFO ] Transformed 2398 places.
[2023-03-23 12:13:28] [INFO ] Transformed 1954 transitions.
[2023-03-23 12:13:28] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 329 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-23 12:13:28] [INFO ] Computed 6 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 2147 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 890 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2023-03-23 12:13:28] [INFO ] Computed 6 place invariants in 54 ms
[2023-03-23 12:13:28] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-23 12:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:29] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-23 12:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:29] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-23 12:13:30] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-23 12:13:30] [INFO ] [Nat]Added 1674 Read/Feed constraints in 442 ms returned sat
[2023-03-23 12:13:30] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 2 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 2 ms to minimize.
[2023-03-23 12:13:31] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2023-03-23 12:13:35] [INFO ] Deduced a trap composed of 37 places in 3470 ms of which 2 ms to minimize.
[2023-03-23 12:13:35] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 12:13:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:36] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-23 12:13:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-23 12:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:36] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-23 12:13:37] [INFO ] [Nat]Added 1674 Read/Feed constraints in 844 ms returned sat
[2023-03-23 12:13:37] [INFO ] Deduced a trap composed of 282 places in 304 ms of which 1 ms to minimize.
[2023-03-23 12:13:38] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 0 ms to minimize.
[2023-03-23 12:13:38] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 2 ms to minimize.
[2023-03-23 12:13:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1185 ms
[2023-03-23 12:13:39] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 477 ms.
[2023-03-23 12:13:40] [INFO ] Added : 19 causal constraints over 4 iterations in 1536 ms. Result :sat
Minimization took 492 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 373
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 363
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1168 place count 179 transition count 272
Iterating global reduction 2 with 91 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1332 place count 140 transition count 184
Iterating global reduction 3 with 39 rules applied. Total rules applied 1371 place count 140 transition count 184
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1395 place count 140 transition count 160
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1404 place count 131 transition count 147
Iterating global reduction 4 with 9 rules applied. Total rules applied 1413 place count 131 transition count 147
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1422 place count 122 transition count 138
Iterating global reduction 4 with 9 rules applied. Total rules applied 1431 place count 122 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1436 place count 117 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 1441 place count 117 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1443 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1448 place count 112 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 1453 place count 112 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1456 place count 109 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 1459 place count 109 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1460 place count 108 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 1461 place count 108 transition count 121
Applied a total of 1461 rules in 140 ms. Remains 108 /414 variables (removed 306) and now considering 121/1954 (removed 1833) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/414 places, 121/1954 transitions.
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:41] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224139 resets, run finished after 1166 ms. (steps per millisecond=857 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103576 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103500 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 2) seen :0
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:43] [INFO ] Computed 4 place invariants in 27 ms
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-23 12:13:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-23 12:13:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-23 12:13:43] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2023-03-23 12:13:43] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-23 12:13:45] [INFO ] Deduced a trap composed of 32 places in 1530 ms of which 26 ms to minimize.
[2023-03-23 12:13:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1621 ms
[2023-03-23 12:13:45] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 18 ms.
[2023-03-23 12:13:45] [INFO ] Added : 19 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:45] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-23 12:13:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2023-03-23 12:13:45] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 14 ms.
[2023-03-23 12:13:45] [INFO ] Added : 21 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 121/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:45] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-23 12:13:46] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-23 12:13:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-23 12:13:46] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 121/121 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:46] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-23 12:13:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-23 12:13:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-23 12:13:46] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2023-03-23 12:13:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-23 12:13:46] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2023-03-23 12:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-23 12:13:46] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 6 ms.
[2023-03-23 12:13:46] [INFO ] Added : 19 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 106 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 106 transition count 118
Applied a total of 5 rules in 20 ms. Remains 106 /108 variables (removed 2) and now considering 118/121 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/108 places, 118/121 transitions.
// Phase 1: matrix 118 rows 106 cols
[2023-03-23 12:13:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224262 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103353 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 1) seen :0
// Phase 1: matrix 118 rows 106 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-23 12:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:48] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-23 12:13:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 12:13:48] [INFO ] [Nat]Added 44 Read/Feed constraints in 12 ms returned sat
[2023-03-23 12:13:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-23 12:13:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-23 12:13:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-23 12:13:48] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 5 ms.
[2023-03-23 12:13:48] [INFO ] Added : 20 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 106 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:48] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 118 rows 106 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-23 12:13:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 12:13:48] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-23 12:13:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 118 rows 106 cols
[2023-03-23 12:13:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:49] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 118/118 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 in 2780 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-15
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:49] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 984 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 121 rows 108 cols
[2023-03-23 12:13:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:49] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-23 12:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 12:13:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-23 12:13:49] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2023-03-23 12:13:49] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-23 12:13:49] [INFO ] Added : 21 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 119
Applied a total of 3 rules in 21 ms. Remains 107 /108 variables (removed 1) and now considering 119/121 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/108 places, 119/121 transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-23 12:13:49] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224683 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103533 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :0
// Phase 1: matrix 119 rows 107 cols
[2023-03-23 12:13:50] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:51] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-23 12:13:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:51] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-23 12:13:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 12:13:51] [INFO ] [Nat]Added 44 Read/Feed constraints in 15 ms returned sat
[2023-03-23 12:13:51] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints (skipped 89 transitions) in 11 ms.
[2023-03-23 12:13:51] [INFO ] Added : 19 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [19] Max seen :[0]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 119/119 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 107 cols
[2023-03-23 12:13:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:51] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 119 rows 107 cols
[2023-03-23 12:13:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-23 12:13:52] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-23 12:13:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 119 rows 107 cols
[2023-03-23 12:13:52] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 12:13:52] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 119/119 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 in 3206 ms.
[2023-03-23 12:13:52] [INFO ] Flatten gal took : 39 ms
[2023-03-23 12:13:52] [INFO ] Applying decomposition
[2023-03-23 12:13:52] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph446194247521027141.txt' '-o' '/tmp/graph446194247521027141.bin' '-w' '/tmp/graph446194247521027141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph446194247521027141.bin' '-l' '-1' '-v' '-w' '/tmp/graph446194247521027141.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:13:52] [INFO ] Decomposing Gal with order
[2023-03-23 12:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:13:52] [INFO ] Removed a total of 104 redundant transitions.
[2023-03-23 12:13:52] [INFO ] Flatten gal took : 50 ms
[2023-03-23 12:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 7 ms.
[2023-03-23 12:13:52] [INFO ] Time to serialize gal into /tmp/UpperBounds6002627259939321129.gal : 5 ms
[2023-03-23 12:13:52] [INFO ] Time to serialize properties into /tmp/UpperBounds13161430322929330173.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6002627259939321129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13161430322929330173.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds13161430322929330173.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,924,0.068075,5468,251,195,2375,1711,382,3228,133,3475,0
Total reachable state count : 924

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 :0 <= i2.u9.l198 <= 0
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m04-UpperBounds-12,0,0.070671,5468,1,0,2375,1711,504,3228,154,3475,421
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 :0 <= i2.u12.p53 <= 0
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m04-UpperBounds-15,0,0.071027,5468,1,0,2375,1711,527,3228,163,3475,461
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 25041 ms.

BK_STOP 1679573632855

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is SieveSingleMsgMbox-PT-d2m04, 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 r447-tajo-167905989500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;