Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361500066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361500066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 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 QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716773531056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 01:32:12] [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]
[2024-05-27 01:32:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:32:12] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-27 01:32:12] [INFO ] Transformed 3806 places.
[2024-05-27 01:32:12] [INFO ] Transformed 506 transitions.
[2024-05-27 01:32:12] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 506 rows 3806 cols
[2024-05-27 01:32:13] [INFO ] Computed 3301 invariants in 184 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 268 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 15) seen :21
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :1
[2024-05-27 01:32:13] [INFO ] Invariant cache hit.
[2024-05-27 01:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 41 ms returned sat
[2024-05-27 01:32:14] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 780 ms returned sat
[2024-05-27 01:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:16] [INFO ] [Real]Absence check using state equation in 1307 ms returned sat
[2024-05-27 01:32:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 52 ms returned sat
[2024-05-27 01:32:17] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 761 ms returned sat
[2024-05-27 01:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:19] [INFO ] [Nat]Absence check using state equation in 1341 ms returned sat
[2024-05-27 01:32:19] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 114 ms.
[2024-05-27 01:32:20] [INFO ] Added : 66 causal constraints over 14 iterations in 1592 ms. Result :sat
Minimization took 523 ms.
[2024-05-27 01:32:21] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:32:22] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 767 ms returned sat
[2024-05-27 01:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:24] [INFO ] [Real]Absence check using state equation in 1392 ms returned sat
[2024-05-27 01:32:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 41 ms returned sat
[2024-05-27 01:32:25] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 767 ms returned sat
[2024-05-27 01:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:26] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2024-05-27 01:32:26] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2024-05-27 01:32:27] [INFO ] Added : 49 causal constraints over 10 iterations in 1057 ms. Result :sat
Minimization took 193 ms.
[2024-05-27 01:32:28] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2024-05-27 01:32:29] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 756 ms returned sat
[2024-05-27 01:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:30] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2024-05-27 01:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 40 ms returned sat
[2024-05-27 01:32:31] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 756 ms returned sat
[2024-05-27 01:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:33] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2024-05-27 01:32:33] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 47 ms.
[2024-05-27 01:32:34] [INFO ] Added : 78 causal constraints over 16 iterations in 1496 ms. Result :sat
Minimization took 203 ms.
[2024-05-27 01:32:35] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2024-05-27 01:32:36] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 751 ms returned sat
[2024-05-27 01:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:37] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2024-05-27 01:32:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2024-05-27 01:32:38] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 790 ms returned sat
[2024-05-27 01:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:40] [INFO ] [Nat]Absence check using state equation in 1458 ms returned sat
[2024-05-27 01:32:40] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2024-05-27 01:32:41] [INFO ] Added : 36 causal constraints over 8 iterations in 847 ms. Result :sat
Minimization took 268 ms.
[2024-05-27 01:32:41] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2024-05-27 01:32:42] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 732 ms returned sat
[2024-05-27 01:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:43] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2024-05-27 01:32:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 33 ms returned sat
[2024-05-27 01:32:44] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 737 ms returned sat
[2024-05-27 01:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:46] [INFO ] [Nat]Absence check using state equation in 1331 ms returned sat
[2024-05-27 01:32:46] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 71 ms.
[2024-05-27 01:32:48] [INFO ] Added : 134 causal constraints over 27 iterations in 2401 ms. Result :sat
Minimization took 58 ms.
[2024-05-27 01:32:49] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:32:50] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 789 ms returned sat
[2024-05-27 01:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:53] [INFO ] [Real]Absence check using state equation in 2968 ms returned sat
[2024-05-27 01:32:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:32:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 37 ms returned sat
[2024-05-27 01:32:54] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 768 ms returned sat
[2024-05-27 01:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:32:56] [INFO ] [Nat]Absence check using state equation in 2611 ms returned sat
[2024-05-27 01:32:57] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2024-05-27 01:33:02] [INFO ] Deduced a trap composed of 5 places in 4640 ms of which 17 ms to minimize.
[2024-05-27 01:33:02] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-27 01:33:03] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2024-05-27 01:33:04] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 722 ms returned sat
[2024-05-27 01:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:05] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2024-05-27 01:33:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2024-05-27 01:33:06] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 750 ms returned sat
[2024-05-27 01:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:08] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2024-05-27 01:33:08] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
[2024-05-27 01:33:08] [INFO ] Added : 33 causal constraints over 7 iterations in 841 ms. Result :sat
Minimization took 198 ms.
[2024-05-27 01:33:09] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:10] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 725 ms returned sat
[2024-05-27 01:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:11] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2024-05-27 01:33:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:12] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 760 ms returned sat
[2024-05-27 01:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:14] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2024-05-27 01:33:14] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2024-05-27 01:33:15] [INFO ] Added : 67 causal constraints over 14 iterations in 1468 ms. Result :sat
Minimization took 191 ms.
[2024-05-27 01:33:16] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2024-05-27 01:33:16] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 742 ms returned sat
[2024-05-27 01:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:18] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2024-05-27 01:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:19] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 755 ms returned sat
[2024-05-27 01:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:20] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2024-05-27 01:33:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 34 ms.
[2024-05-27 01:33:27] [INFO ] Deduced a trap composed of 5 places in 4203 ms of which 11 ms to minimize.
[2024-05-27 01:33:27] [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 8
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-27 01:33:27] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2024-05-27 01:33:28] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 778 ms returned sat
[2024-05-27 01:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:30] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2024-05-27 01:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2024-05-27 01:33:31] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 768 ms returned sat
[2024-05-27 01:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:32] [INFO ] [Nat]Absence check using state equation in 1253 ms returned sat
[2024-05-27 01:33:32] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2024-05-27 01:33:34] [INFO ] Added : 101 causal constraints over 21 iterations in 1941 ms. Result :sat
Minimization took 191 ms.
[2024-05-27 01:33:35] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2024-05-27 01:33:35] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 743 ms returned sat
[2024-05-27 01:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:37] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2024-05-27 01:33:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:38] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 782 ms returned sat
[2024-05-27 01:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:39] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2024-05-27 01:33:40] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2024-05-27 01:33:40] [INFO ] Added : 49 causal constraints over 10 iterations in 958 ms. Result :sat
Minimization took 192 ms.
[2024-05-27 01:33:41] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2024-05-27 01:33:42] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 830 ms returned sat
[2024-05-27 01:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:43] [INFO ] [Real]Absence check using state equation in 1082 ms returned unsat
[2024-05-27 01:33:43] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 780 ms returned sat
[2024-05-27 01:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:46] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2024-05-27 01:33:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:33:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2024-05-27 01:33:47] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 781 ms returned sat
[2024-05-27 01:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:33:48] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2024-05-27 01:33:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 40 ms.
[2024-05-27 01:33:55] [INFO ] Deduced a trap composed of 5 places in 4424 ms of which 6 ms to minimize.
[2024-05-27 01:33:55] [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 12
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1089, 1089, 1, 1, 33, 33, 1, 1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 134 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2613 are kept as prefixes of interest. Removing 1193 places using SCC suffix rule.20 ms
Discarding 1193 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 2547 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 270 place count 2546 transition count 269
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 270 place count 2546 transition count 203
Deduced a syphon composed of 66 places in 2 ms
Ensure Unique test removed 65 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 467 place count 2415 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 467 place count 2415 transition count 202
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 470 place count 2413 transition count 202
Applied a total of 470 rules in 423 ms. Remains 2413 /3806 variables (removed 1393) and now considering 202/506 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 2413/3806 places, 202/506 transitions.
// Phase 1: matrix 202 rows 2413 cols
[2024-05-27 01:33:56] [INFO ] Computed 2211 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 7865 resets, run finished after 18281 ms. (steps per millisecond=54 ) properties (out of 7) seen :108
Finished Best-First random walk after 534787 steps, including 213 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=106 )
Finished Best-First random walk after 544359 steps, including 220 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=108 )
Finished Best-First random walk after 402955 steps, including 78 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=80 )
Finished Best-First random walk after 571554 steps, including 232 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=114 )
Finished Best-First random walk after 610775 steps, including 246 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=122 )
Finished Best-First random walk after 574452 steps, including 201 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=114 )
Finished Best-First random walk after 619767 steps, including 248 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=123 )
[2024-05-27 01:34:49] [INFO ] Invariant cache hit.
[2024-05-27 01:34:50] [INFO ] [Real]Absence check using 1089 positive place invariants in 256 ms returned sat
[2024-05-27 01:34:50] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 264 ms returned unsat
[2024-05-27 01:34:50] [INFO ] [Real]Absence check using 1089 positive place invariants in 223 ms returned sat
[2024-05-27 01:34:51] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 250 ms returned unsat
[2024-05-27 01:34:51] [INFO ] [Real]Absence check using 1089 positive place invariants in 238 ms returned sat
[2024-05-27 01:34:51] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 241 ms returned sat
[2024-05-27 01:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:34:51] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2024-05-27 01:34:52] [INFO ] [Real]Absence check using 1089 positive place invariants in 234 ms returned sat
[2024-05-27 01:34:52] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 393 ms returned sat
[2024-05-27 01:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:34:53] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2024-05-27 01:34:53] [INFO ] Computed and/alt/rep : 134/134/134 causal constraints (skipped 67 transitions) in 23 ms.
[2024-05-27 01:34:54] [INFO ] Added : 98 causal constraints over 20 iterations in 1339 ms. Result :sat
Minimization took 500 ms.
[2024-05-27 01:34:55] [INFO ] [Real]Absence check using 1089 positive place invariants in 232 ms returned sat
[2024-05-27 01:34:55] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 14 ms returned unsat
[2024-05-27 01:34:56] [INFO ] [Real]Absence check using 1089 positive place invariants in 219 ms returned sat
[2024-05-27 01:34:56] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 237 ms returned sat
[2024-05-27 01:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:34:57] [INFO ] [Real]Absence check using state equation in 509 ms returned unsat
[2024-05-27 01:34:57] [INFO ] [Real]Absence check using 1089 positive place invariants in 227 ms returned sat
[2024-05-27 01:34:57] [INFO ] [Real]Absence check using 1089 positive and 1122 generalized place invariants in 148 ms returned unsat
Current structural bounds on expressions (after SMT) : [33, 33, 33, 59, 1, 1, 1] Max seen :[33, 33, 33, 23, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 33 out of 2413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2413/2413 places, 202/202 transitions.
Graph (complete) has 40493 edges and 2413 vertex of which 2412 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 2412 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 2411 transition count 167
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 37 place count 2411 transition count 101
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 202 place count 2312 transition count 101
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 2312 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 2311 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1056 places
Reduce places removed 1089 places and 0 transitions.
Iterating global reduction 4 with 1122 rules applied. Total rules applied 1326 place count 1222 transition count 67
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1327 place count 1221 transition count 66
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 1360 place count 1188 transition count 66
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 5 with 33 rules applied. Total rules applied 1393 place count 1155 transition count 33
Ensure Unique test removed 1089 places
Iterating post reduction 5 with 1089 rules applied. Total rules applied 2482 place count 66 transition count 33
Applied a total of 2482 rules in 382 ms. Remains 66 /2413 variables (removed 2347) and now considering 33/202 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 66/2413 places, 33/202 transitions.
// Phase 1: matrix 33 rows 66 cols
[2024-05-27 01:34:58] [INFO ] Computed 33 invariants in 1 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 29411 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 167555 ms.

BK_STOP 1716773700994

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-32, 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 r329-tall-171662361500066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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