About the Execution of ITS-Tools for BusinessProcesses-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 409.371 | 31084.00 | 45541.00 | 47.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399800557.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800557
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 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 BusinessProcesses-PT-14-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716336102403
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 00:01:43] [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-22 00:01:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:01:43] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 00:01:43] [INFO ] Transformed 624 places.
[2024-05-22 00:01:43] [INFO ] Transformed 564 transitions.
[2024-05-22 00:01:43] [INFO ] Found NUPN structural information;
[2024-05-22 00:01:43] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 556 rows 616 cols
[2024-05-22 00:01:43] [INFO ] Computed 99 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (67 resets) in 48 ms. (204 steps per ms)
FORMULA BusinessProcesses-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (60 resets) in 55 ms. (892 steps per ms)
FORMULA BusinessProcesses-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-22 00:01:44] [INFO ] Invariant cache hit.
[2024-05-22 00:01:44] [INFO ] [Real]Absence check using 60 positive place invariants in 21 ms returned sat
[2024-05-22 00:01:44] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-22 00:01:44] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 22 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:01:44] [INFO ] [Nat]Absence check using 60 positive place invariants in 28 ms returned sat
[2024-05-22 00:01:44] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2024-05-22 00:01:45] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:01:45] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 5 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:01:46] [INFO ] Deduced a trap composed of 143 places in 191 ms of which 4 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:01:47] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 5 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:01:48] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [INFO ] Deduced a trap composed of 147 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:01:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:01:50] [INFO ] [Real]Absence check using 60 positive place invariants in 25 ms returned sat
[2024-05-22 00:01:50] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-22 00:01:50] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-22 00:01:50] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:01:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2024-05-22 00:01:50] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-22 00:01:50] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-22 00:01:50] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 8 ms to minimize.
[2024-05-22 00:01:51] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:01:52] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 5 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 130 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:01: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 1
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:01:55] [INFO ] [Real]Absence check using 60 positive place invariants in 16 ms returned sat
[2024-05-22 00:01:55] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2024-05-22 00:01:55] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 5 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:01:56] [INFO ] [Nat]Absence check using 60 positive place invariants in 17 ms returned sat
[2024-05-22 00:01:56] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2024-05-22 00:01:56] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 4 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 154 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:02:01] [INFO ] [Real]Absence check using 60 positive place invariants in 18 ms returned sat
[2024-05-22 00:02:01] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2024-05-22 00:02:01] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:02:01] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2024-05-22 00:02:01] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2024-05-22 00:02:02] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 4 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 5 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 4 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 4 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 4 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 150 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 4 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 7 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:05] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:02:06] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 355 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 604 transition count 408
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 280 place count 465 transition count 408
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 280 place count 465 transition count 318
Deduced a syphon composed of 90 places in 5 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 477 place count 358 transition count 318
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 560 place count 275 transition count 235
Iterating global reduction 2 with 83 rules applied. Total rules applied 643 place count 275 transition count 235
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 643 place count 275 transition count 225
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 666 place count 262 transition count 225
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 848 place count 171 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 850 place count 170 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 852 place count 170 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 854 place count 168 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 855 place count 168 transition count 136
Applied a total of 855 rules in 230 ms. Remains 168 /616 variables (removed 448) and now considering 136/556 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 168/616 places, 136/556 transitions.
// Phase 1: matrix 136 rows 168 cols
[2024-05-22 00:02:07] [INFO ] Computed 74 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (43060 resets) in 3576 ms. (279 steps per ms)
FORMULA BusinessProcesses-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (24305 resets) in 2359 ms. (423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-22 00:02:13] [INFO ] Flatten gal took : 104 ms
[2024-05-22 00:02:13] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7723980880634941568.gal : 17 ms
[2024-05-22 00:02:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1218790632687931928.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7723980880634941568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1218790632687931928.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 29814 ms.
BK_STOP 1716336133487
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BusinessProcesses-PT-14"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, 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 r048-tajo-171620399800557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 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 '
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 ;