Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205700861.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205700861
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.9M May 5 16:52 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 ShieldPPPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1622927283035

Running Version 0
[2021-06-05 21:08:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-05 21:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-05 21:08:05] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2021-06-05 21:08:05] [INFO ] Transformed 7803 places.
[2021-06-05 21:08:05] [INFO ] Transformed 7103 transitions.
[2021-06-05 21:08:05] [INFO ] Found NUPN structural information;
[2021-06-05 21:08:05] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 737 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 7103 rows 7803 cols
[2021-06-05 21:08:05] [INFO ] Computed 1101 place invariants in 81 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
// Phase 1: matrix 7103 rows 7803 cols
[2021-06-05 21:08:06] [INFO ] Computed 1101 place invariants in 31 ms
[2021-06-05 21:08:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 793 ms returned sat
[2021-06-05 21:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:11] [INFO ] [Real]Absence check using state equation in 2776 ms returned unknown
[2021-06-05 21:08:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 845 ms returned sat
[2021-06-05 21:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:16] [INFO ] [Real]Absence check using state equation in 2980 ms returned unknown
[2021-06-05 21:08:18] [INFO ] [Real]Absence check using 1101 positive place invariants in 817 ms returned sat
[2021-06-05 21:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:21] [INFO ] [Real]Absence check using state equation in 3083 ms returned unknown
[2021-06-05 21:08:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 830 ms returned sat
[2021-06-05 21:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:26] [INFO ] [Real]Absence check using state equation in 3010 ms returned unknown
[2021-06-05 21:08:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 786 ms returned sat
[2021-06-05 21:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:31] [INFO ] [Real]Absence check using state equation in 3157 ms returned unknown
[2021-06-05 21:08:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 762 ms returned sat
[2021-06-05 21:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:36] [INFO ] [Real]Absence check using state equation in 3139 ms returned unknown
[2021-06-05 21:08:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 761 ms returned sat
[2021-06-05 21:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:41] [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: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-05 21:08:43] [INFO ] [Real]Absence check using 1101 positive place invariants in 831 ms returned sat
[2021-06-05 21:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:46] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-05 21:08:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 815 ms returned sat
[2021-06-05 21:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:51] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-05 21:08:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 784 ms returned sat
[2021-06-05 21:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:56] [INFO ] [Real]Absence check using state equation in 3156 ms returned unknown
[2021-06-05 21:08:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 795 ms returned sat
[2021-06-05 21:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:01] [INFO ] [Real]Absence check using state equation in 3115 ms returned unknown
[2021-06-05 21:09:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 760 ms returned sat
[2021-06-05 21:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:06] [INFO ] [Real]Absence check using state equation in 3187 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 7803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1897 transitions
Trivial Post-agglo rules discarded 1897 transitions
Performed 1897 trivial Post agglomeration. Transition count delta: 1897
Iterating post reduction 0 with 1897 rules applied. Total rules applied 1897 place count 7803 transition count 5206
Reduce places removed 1897 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 1899 rules applied. Total rules applied 3796 place count 5906 transition count 5204
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 3799 place count 5905 transition count 5202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3801 place count 5903 transition count 5202
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 400 Pre rules applied. Total rules applied 3801 place count 5903 transition count 4802
Deduced a syphon composed of 400 places in 25 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 4 with 800 rules applied. Total rules applied 4601 place count 5503 transition count 4802
Discarding 695 places :
Symmetric choice reduction at 4 with 695 rule applications. Total rules 5296 place count 4808 transition count 4107
Iterating global reduction 4 with 695 rules applied. Total rules applied 5991 place count 4808 transition count 4107
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 297 Pre rules applied. Total rules applied 5991 place count 4808 transition count 3810
Deduced a syphon composed of 297 places in 19 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 4 with 594 rules applied. Total rules applied 6585 place count 4511 transition count 3810
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 9 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 4 with 3398 rules applied. Total rules applied 9983 place count 2812 transition count 2111
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10185 place count 2711 transition count 2111
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10387 place count 2610 transition count 2111
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 21 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 10573 place count 2517 transition count 2111
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 10576 place count 2517 transition count 2108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 10579 place count 2514 transition count 2108
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 5 with 299 rules applied. Total rules applied 10878 place count 2514 transition count 2108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10879 place count 2513 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10880 place count 2512 transition count 2107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10880 place count 2512 transition count 2105
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10884 place count 2510 transition count 2105
Applied a total of 10884 rules in 4573 ms. Remains 2510 /7803 variables (removed 5293) and now considering 2105/7103 (removed 4998) transitions.
Finished structural reductions, in 1 iterations. Remains : 2510/7803 places, 2105/7103 transitions.
// Phase 1: matrix 2105 rows 2510 cols
[2021-06-05 21:09:11] [INFO ] Computed 1100 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14293 ms. (steps per millisecond=69 ) properties (out of 12) seen :2
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 478845 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :{}
Interrupted Best-First random walk after 475816 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :{}
Interrupted Best-First random walk after 482396 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Interrupted Best-First random walk after 482675 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Interrupted Best-First random walk after 478410 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :{}
Interrupted Best-First random walk after 486062 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :{}
Interrupted Best-First random walk after 484405 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Interrupted Best-First random walk after 481746 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :{}
Interrupted Best-First random walk after 487950 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :{}
Interrupted Best-First random walk after 479435 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :{}
// Phase 1: matrix 2105 rows 2510 cols
[2021-06-05 21:10:15] [INFO ] Computed 1100 place invariants in 3 ms
[2021-06-05 21:10:15] [INFO ] [Real]Absence check using 1100 positive place invariants in 202 ms returned sat
[2021-06-05 21:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:16] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2021-06-05 21:10:16] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:10:17] [INFO ] [Nat]Absence check using 1100 positive place invariants in 190 ms returned sat
[2021-06-05 21:10:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:18] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2021-06-05 21:10:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-06-05 21:10:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-06-05 21:10:18] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 6 ms to minimize.
[2021-06-05 21:10:19] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 2 ms to minimize.
[2021-06-05 21:10:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 878 ms
[2021-06-05 21:10:19] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 211 ms.
[2021-06-05 21:10:39] [INFO ] Added : 830 causal constraints over 166 iterations in 20110 ms.(timeout) Result :sat
Minimization took 380 ms.
[2021-06-05 21:10:40] [INFO ] [Real]Absence check using 1100 positive place invariants in 226 ms returned sat
[2021-06-05 21:10:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:41] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2021-06-05 21:10:41] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:10:42] [INFO ] [Nat]Absence check using 1100 positive place invariants in 202 ms returned sat
[2021-06-05 21:10:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:42] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2021-06-05 21:10:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 13 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2021-06-05 21:10:44] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2021-06-05 21:10:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1324 ms
[2021-06-05 21:10:44] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 193 ms.
[2021-06-05 21:11:04] [INFO ] Added : 840 causal constraints over 168 iterations in 20119 ms.(timeout) Result :sat
Minimization took 399 ms.
[2021-06-05 21:11:05] [INFO ] [Real]Absence check using 1100 positive place invariants in 197 ms returned sat
[2021-06-05 21:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:06] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2021-06-05 21:11:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:11:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 202 ms returned sat
[2021-06-05 21:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:07] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2021-06-05 21:11:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 1 ms to minimize.
[2021-06-05 21:11:09] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2021-06-05 21:11:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1437 ms
[2021-06-05 21:11:09] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 199 ms.
[2021-06-05 21:11:29] [INFO ] Added : 860 causal constraints over 172 iterations in 20052 ms.(timeout) Result :sat
Minimization took 416 ms.
[2021-06-05 21:11:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 194 ms returned sat
[2021-06-05 21:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:31] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2021-06-05 21:11:31] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:11:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 198 ms returned sat
[2021-06-05 21:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:32] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2021-06-05 21:11:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:11:32] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2021-06-05 21:11:33] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2021-06-05 21:11:33] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2021-06-05 21:11:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 806 ms
[2021-06-05 21:11:33] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 99 ms.
[2021-06-05 21:11:53] [INFO ] Added : 880 causal constraints over 176 iterations in 20176 ms.(timeout) Result :sat
Minimization took 407 ms.
[2021-06-05 21:11:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 193 ms returned sat
[2021-06-05 21:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:55] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2021-06-05 21:11:55] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:11:55] [INFO ] [Nat]Absence check using 1100 positive place invariants in 195 ms returned sat
[2021-06-05 21:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:56] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2021-06-05 21:11:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:11:57] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2021-06-05 21:11:57] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2021-06-05 21:11:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2021-06-05 21:11:57] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 94 ms.
[2021-06-05 21:12:17] [INFO ] Added : 855 causal constraints over 171 iterations in 20081 ms.(timeout) Result :sat
Minimization took 387 ms.
[2021-06-05 21:12:18] [INFO ] [Real]Absence check using 1100 positive place invariants in 197 ms returned sat
[2021-06-05 21:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:19] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2021-06-05 21:12:19] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:12:19] [INFO ] [Nat]Absence check using 1100 positive place invariants in 195 ms returned sat
[2021-06-05 21:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:20] [INFO ] [Nat]Absence check using state equation in 898 ms returned sat
[2021-06-05 21:12:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:12:21] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2021-06-05 21:12:21] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2021-06-05 21:12:21] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2021-06-05 21:12:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2021-06-05 21:12:21] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 90 ms.
[2021-06-05 21:12:41] [INFO ] Added : 885 causal constraints over 177 iterations in 20127 ms.(timeout) Result :sat
Minimization took 365 ms.
[2021-06-05 21:12:42] [INFO ] [Real]Absence check using 1100 positive place invariants in 195 ms returned sat
[2021-06-05 21:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:43] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2021-06-05 21:12:43] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:12:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 195 ms returned sat
[2021-06-05 21:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:44] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2021-06-05 21:12:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:12:45] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 0 ms to minimize.
[2021-06-05 21:12:45] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 9 ms to minimize.
[2021-06-05 21:12:45] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2021-06-05 21:12:46] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 5 ms to minimize.
[2021-06-05 21:12:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2021-06-05 21:12:46] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 95 ms.
[2021-06-05 21:13:06] [INFO ] Added : 855 causal constraints over 171 iterations in 20074 ms.(timeout) Result :sat
Minimization took 350 ms.
[2021-06-05 21:13:07] [INFO ] [Real]Absence check using 1100 positive place invariants in 189 ms returned sat
[2021-06-05 21:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:07] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2021-06-05 21:13:08] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:13:08] [INFO ] [Nat]Absence check using 1100 positive place invariants in 190 ms returned sat
[2021-06-05 21:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:09] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2021-06-05 21:13:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:13:09] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 102 ms.
[2021-06-05 21:13:29] [INFO ] Added : 905 causal constraints over 181 iterations in 20280 ms.(timeout) Result :sat
Minimization took 418 ms.
[2021-06-05 21:13:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 191 ms returned sat
[2021-06-05 21:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:31] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2021-06-05 21:13:31] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:13:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 189 ms returned sat
[2021-06-05 21:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:32] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2021-06-05 21:13:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:13:33] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2021-06-05 21:13:33] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2021-06-05 21:13:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2021-06-05 21:13:33] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 187 ms.
[2021-06-05 21:13:53] [INFO ] Added : 860 causal constraints over 172 iterations in 20185 ms.(timeout) Result :sat
Minimization took 446 ms.
[2021-06-05 21:13:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 189 ms returned sat
[2021-06-05 21:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:55] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2021-06-05 21:13:55] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:13:55] [INFO ] [Nat]Absence check using 1100 positive place invariants in 187 ms returned sat
[2021-06-05 21:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:13:56] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2021-06-05 21:13:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2021-06-05 21:13:57] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2021-06-05 21:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2021-06-05 21:13:57] [INFO ] Computed and/alt/rep : 2101/4966/2101 causal constraints (skipped 0 transitions) in 93 ms.
[2021-06-05 21:14:17] [INFO ] Added : 865 causal constraints over 173 iterations in 20225 ms.(timeout) Result :sat
Minimization took 357 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 153500 steps, including 944 resets, run finished after 2439 ms. (steps per millisecond=62 ) properties (out of 10) seen :9 could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 154800 steps, including 1000 resets, run finished after 2248 ms. (steps per millisecond=68 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1622927663629

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, 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 r216-tall-162098205700861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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