Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r491-tall-167912710500469.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Szymanski-PT-b06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r491-tall-167912710500469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-UpperBounds-00
FORMULA_NAME Szymanski-PT-b06-UpperBounds-01
FORMULA_NAME Szymanski-PT-b06-UpperBounds-02
FORMULA_NAME Szymanski-PT-b06-UpperBounds-03
FORMULA_NAME Szymanski-PT-b06-UpperBounds-04
FORMULA_NAME Szymanski-PT-b06-UpperBounds-05
FORMULA_NAME Szymanski-PT-b06-UpperBounds-06
FORMULA_NAME Szymanski-PT-b06-UpperBounds-07
FORMULA_NAME Szymanski-PT-b06-UpperBounds-08
FORMULA_NAME Szymanski-PT-b06-UpperBounds-09
FORMULA_NAME Szymanski-PT-b06-UpperBounds-10
FORMULA_NAME Szymanski-PT-b06-UpperBounds-11
FORMULA_NAME Szymanski-PT-b06-UpperBounds-12
FORMULA_NAME Szymanski-PT-b06-UpperBounds-13
FORMULA_NAME Szymanski-PT-b06-UpperBounds-14
FORMULA_NAME Szymanski-PT-b06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679257029375

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-19 20:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 20:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:17:11] [INFO ] Load time of PNML (sax parser for PT used): 456 ms
[2023-03-19 20:17:11] [INFO ] Transformed 568 places.
[2023-03-19 20:17:11] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:17:11] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:17:12] [INFO ] Computed 3 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :9
FORMULA Szymanski-PT-b06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :10
FORMULA Szymanski-PT-b06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :8
FORMULA Szymanski-PT-b06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :6
[2023-03-19 20:17:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-19 20:17:12] [INFO ] Computed 3 place invariants in 34 ms
[2023-03-19 20:17:12] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-19 20:17:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:13] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-19 20:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:14] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-19 20:17:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:17:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 1171 ms returned sat
[2023-03-19 20:17:16] [INFO ] Deduced a trap composed of 138 places in 801 ms of which 4 ms to minimize.
[2023-03-19 20:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 979 ms
[2023-03-19 20:17:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 599 ms.
[2023-03-19 20:17:17] [INFO ] Added : 0 causal constraints over 0 iterations in 791 ms. Result :sat
Minimization took 642 ms.
[2023-03-19 20:17:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-19 20:17:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:18] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-19 20:17:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:18] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:19] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2023-03-19 20:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:17:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 4230 ms returned unknown
[2023-03-19 20:17:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:24] [INFO ] [Real]Absence check using state equation in 801 ms returned unsat
[2023-03-19 20:17:24] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:25] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-19 20:17:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:25] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-19 20:17:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 2384 ms returned sat
[2023-03-19 20:17:29] [INFO ] Deduced a trap composed of 47 places in 670 ms of which 2 ms to minimize.
[2023-03-19 20:17:29] [INFO ] Deduced a trap composed of 38 places in 607 ms of which 2 ms to minimize.
[2023-03-19 20:17:30] [INFO ] Deduced a trap composed of 51 places in 544 ms of which 1 ms to minimize.
[2023-03-19 20:17:30] [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 3
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-19 20:17:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:31] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2023-03-19 20:17:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:31] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2023-03-19 20:17:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:17:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 4266 ms returned unknown
[2023-03-19 20:17:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 20:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:36] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-19 20:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:37] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-19 20:17:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 867 ms returned sat
[2023-03-19 20:17:38] [INFO ] Deduced a trap composed of 44 places in 625 ms of which 1 ms to minimize.
[2023-03-19 20:17:39] [INFO ] Deduced a trap composed of 38 places in 618 ms of which 1 ms to minimize.
[2023-03-19 20:17:40] [INFO ] Deduced a trap composed of 49 places in 606 ms of which 1 ms to minimize.
[2023-03-19 20:17:40] [INFO ] Deduced a trap composed of 77 places in 504 ms of which 1 ms to minimize.
[2023-03-19 20:17:41] [INFO ] Deduced a trap composed of 76 places in 473 ms of which 0 ms to minimize.
[2023-03-19 20:17:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3166 ms
[2023-03-19 20:17:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 413 ms.
[2023-03-19 20:17:42] [INFO ] Deduced a trap composed of 32 places in 693 ms of which 1 ms to minimize.
[2023-03-19 20:17:42] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-19 20:17:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 20:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:43] [INFO ] [Real]Absence check using state equation in 833 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 13, 6, 1, 13, 1, 6] Max seen :[0, 6, 6, 0, 5, 0, 6]
FORMULA Szymanski-PT-b06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 472 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:17:43] [INFO ] Computed 3 place invariants in 26 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1917 ms. (steps per millisecond=521 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 4) seen :7
FORMULA Szymanski-PT-b06-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-19 20:17:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:17:50] [INFO ] Computed 3 place invariants in 24 ms
[2023-03-19 20:17:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:50] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-19 20:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:51] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-19 20:17:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:17:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 1144 ms returned sat
[2023-03-19 20:17:53] [INFO ] Deduced a trap composed of 137 places in 565 ms of which 0 ms to minimize.
[2023-03-19 20:17:53] [INFO ] Deduced a trap composed of 132 places in 632 ms of which 1 ms to minimize.
[2023-03-19 20:17:54] [INFO ] Deduced a trap composed of 132 places in 647 ms of which 1 ms to minimize.
[2023-03-19 20:17:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2124 ms
[2023-03-19 20:17:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 387 ms.
[2023-03-19 20:17:55] [INFO ] Deduced a trap composed of 129 places in 599 ms of which 1 ms to minimize.
[2023-03-19 20:17:56] [INFO ] Deduced a trap composed of 129 places in 607 ms of which 1 ms to minimize.
[2023-03-19 20:17:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1451 ms
[2023-03-19 20:17:56] [INFO ] Added : 3 causal constraints over 2 iterations in 2225 ms. Result :sat
Minimization took 1586 ms.
[2023-03-19 20:17:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:59] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2023-03-19 20:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:17:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:17:59] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-19 20:18:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:18:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 6038 ms returned unknown
[2023-03-19 20:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:06] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-19 20:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:06] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-19 20:18:09] [INFO ] [Nat]Added 147 Read/Feed constraints in 2677 ms returned sat
[2023-03-19 20:18:10] [INFO ] Deduced a trap composed of 79 places in 741 ms of which 0 ms to minimize.
[2023-03-19 20:18:10] [INFO ] Deduced a trap composed of 78 places in 565 ms of which 1 ms to minimize.
[2023-03-19 20:18:11] [INFO ] Deduced a trap composed of 130 places in 521 ms of which 0 ms to minimize.
[2023-03-19 20:18:11] [INFO ] Deduced a trap composed of 138 places in 591 ms of which 1 ms to minimize.
[2023-03-19 20:18:12] [INFO ] Deduced a trap composed of 137 places in 646 ms of which 0 ms to minimize.
[2023-03-19 20:18:13] [INFO ] Deduced a trap composed of 135 places in 655 ms of which 1 ms to minimize.
[2023-03-19 20:18:14] [INFO ] Deduced a trap composed of 134 places in 662 ms of which 3 ms to minimize.
[2023-03-19 20:18:14] [INFO ] Deduced a trap composed of 131 places in 606 ms of which 0 ms to minimize.
[2023-03-19 20:18:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5670 ms
[2023-03-19 20:18:15] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 319 ms.
[2023-03-19 20:18:15] [INFO ] Added : 3 causal constraints over 2 iterations in 639 ms. Result :sat
Minimization took 927 ms.
Current structural bounds on expressions (after SMT) : [1, 7, 1] Max seen :[0, 6, 0]
FORMULA Szymanski-PT-b06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Szymanski-PT-b06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 369 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:17] [INFO ] Computed 3 place invariants in 24 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1552 ms. (steps per millisecond=644 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 1) seen :6
[2023-03-19 20:18:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:20] [INFO ] Computed 3 place invariants in 25 ms
[2023-03-19 20:18:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:20] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-19 20:18:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:18:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:21] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-19 20:18:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:18:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:18:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 6039 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 20:18:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:27] [INFO ] Invariant cache hit.
[2023-03-19 20:18:28] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-19 20:18:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:28] [INFO ] Invariant cache hit.
[2023-03-19 20:18:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:18:31] [INFO ] Implicit Places using invariants and state equation in 3074 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
[2023-03-19 20:18:32] [INFO ] Redundant transitions in 892 ms returned []
[2023-03-19 20:18:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:32] [INFO ] Invariant cache hit.
[2023-03-19 20:18:34] [INFO ] Dead Transitions using invariants and state equation in 2666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7410 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b06-UpperBounds-03
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:34] [INFO ] Computed 3 place invariants in 22 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
[2023-03-19 20:18:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:34] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-19 20:18:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:35] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2023-03-19 20:18:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:18:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:36] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-19 20:18:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:18:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:18:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 4441 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:40] [INFO ] Computed 3 place invariants in 22 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1516 ms. (steps per millisecond=659 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 1) seen :6
[2023-03-19 20:18:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:43] [INFO ] Computed 3 place invariants in 22 ms
[2023-03-19 20:18:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:44] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-19 20:18:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:18:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 20:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:18:44] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-19 20:18:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:18:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:18:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 6044 ms returned unknown
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 20:18:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:51] [INFO ] Invariant cache hit.
[2023-03-19 20:18:51] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-19 20:18:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:51] [INFO ] Invariant cache hit.
[2023-03-19 20:18:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:18:54] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
[2023-03-19 20:18:55] [INFO ] Redundant transitions in 854 ms returned []
[2023-03-19 20:18:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:18:55] [INFO ] Invariant cache hit.
[2023-03-19 20:18:57] [INFO ] Dead Transitions using invariants and state equation in 2447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6642 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:18:57] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1592 ms. (steps per millisecond=628 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 1) seen :6
[2023-03-19 20:19:00] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:19:00] [INFO ] Computed 3 place invariants in 20 ms
[2023-03-19 20:19:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:19:00] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-19 20:19:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:19:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:19:01] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-19 20:19:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:19:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 20:19:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 5147 ms returned sat
[2023-03-19 20:19:07] [INFO ] Deduced a trap composed of 31 places in 580 ms of which 1 ms to minimize.
[2023-03-19 20:19:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 626 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA Szymanski-PT-b06-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Szymanski-PT-b06-UpperBounds-03 in 32145 ms.
[2023-03-19 20:19:07] [INFO ] Flatten gal took : 455 ms
Total runtime 116398 ms.
ITS solved all properties within timeout

BK_STOP 1679257148734

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Szymanski-PT-b06, 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 r491-tall-167912710500469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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