Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K Mar 5 18:22 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-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678792701000

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=BusinessProcesses-PT-13
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:18:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 11:18:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:18:22] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-14 11:18:22] [INFO ] Transformed 593 places.
[2023-03-14 11:18:22] [INFO ] Transformed 536 transitions.
[2023-03-14 11:18:22] [INFO ] Found NUPN structural information;
[2023-03-14 11:18:22] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 528 rows 585 cols
[2023-03-14 11:18:22] [INFO ] Computed 95 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 72 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
[2023-03-14 11:18:22] [INFO ] Invariant cache hit.
[2023-03-14 11:18:23] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-14 11:18:23] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-14 11:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:23] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-14 11:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:23] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-14 11:18:23] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2023-03-14 11:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:23] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-14 11:18:23] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 6 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:18:24] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2023-03-14 11:18:25] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:18:25] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2023-03-14 11:18:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-03-14 11:18:25] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-14 11:18:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1691 ms
[2023-03-14 11:18:25] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 31 ms.
[2023-03-14 11:18:27] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 1 ms to minimize.
[2023-03-14 11:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-14 11:18:27] [INFO ] Added : 273 causal constraints over 55 iterations in 2402 ms. Result :sat
Minimization took 112 ms.
[2023-03-14 11:18:28] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 11:18:28] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2023-03-14 11:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:28] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-14 11:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:28] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 11:18:28] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-14 11:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:28] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-14 11:18:28] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2023-03-14 11:18:29] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-14 11:18:29] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:18:29] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 0 ms to minimize.
[2023-03-14 11:18:29] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-14 11:18:29] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2023-03-14 11:18:30] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-14 11:18:30] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2023-03-14 11:18:30] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:18:30] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:18:30] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:18:31] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:18:31] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:18:31] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:18:31] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2023-03-14 11:18:31] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 0 ms to minimize.
[2023-03-14 11:18:32] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 1 ms to minimize.
[2023-03-14 11:18:32] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2023-03-14 11:18:32] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:18:32] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:18:32] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2023-03-14 11:18:33] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:18:33] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:18:33] [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: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-14 11:18:33] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 11:18:33] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-14 11:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:33] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2023-03-14 11:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-14 11:18:33] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-14 11:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:34] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-14 11:18:34] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-14 11:18:34] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-14 11:18:34] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-14 11:18:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1680 ms
[2023-03-14 11:18:35] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 40 ms.
[2023-03-14 11:18:37] [INFO ] Added : 230 causal constraints over 47 iterations in 1428 ms. Result :sat
Minimization took 96 ms.
[2023-03-14 11:18:37] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-14 11:18:37] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-14 11:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:37] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-14 11:18:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 11:18:37] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2023-03-14 11:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:38] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-14 11:18:38] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:18:38] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:18:38] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-14 11:18:38] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-14 11:18:38] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:18:39] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2023-03-14 11:18:39] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 1 ms to minimize.
[2023-03-14 11:18:39] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 0 ms to minimize.
[2023-03-14 11:18:39] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:18:39] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2023-03-14 11:18:40] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:18:40] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:18:40] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 4 ms to minimize.
[2023-03-14 11:18:40] [INFO ] Deduced a trap composed of 114 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:18:40] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:18:41] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2023-03-14 11:18:41] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:18:41] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 1 ms to minimize.
[2023-03-14 11:18:41] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:18:41] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:18:42] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:18:42] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 3 ms to minimize.
[2023-03-14 11:18:42] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2023-03-14 11:18:42] [INFO ] Deduced a trap composed of 133 places in 163 ms of which 2 ms to minimize.
[2023-03-14 11:18:42] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 3 ms to minimize.
[2023-03-14 11:18: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 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-14 11:18:42] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-14 11:18:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-14 11:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:43] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-14 11:18:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-14 11:18:43] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-14 11:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:43] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-14 11:18:43] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 3 ms to minimize.
[2023-03-14 11:18:44] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 0 ms to minimize.
[2023-03-14 11:18:44] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-14 11:18:44] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2023-03-14 11:18:44] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-14 11:18:44] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 1 ms to minimize.
[2023-03-14 11:18:45] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:18:46] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 0 ms to minimize.
[2023-03-14 11:18:47] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 0 ms to minimize.
[2023-03-14 11:18:48] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:18:48] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:18:48] [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 4
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-14 11:18:48] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-14 11:18:48] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-14 11:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:48] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-14 11:18:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:18:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-14 11:18:48] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-14 11:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:18:48] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-14 11:18:49] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2023-03-14 11:18:49] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2023-03-14 11:18:49] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:18:49] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2023-03-14 11:18:49] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 0 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:18:50] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-14 11:18:51] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 0 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 0 ms to minimize.
[2023-03-14 11:18:52] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2023-03-14 11:18:53] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:18:53] [INFO ] Deduced a trap composed of 141 places in 118 ms of which 1 ms to minimize.
[2023-03-14 11:18:53] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:18:53] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2023-03-14 11:18:53] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:18:53] [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.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 332 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 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 removed 1 transitions
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 573 transition count 390
Reduce places removed 129 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 444 transition count 387
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 266 place count 441 transition count 387
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 266 place count 441 transition count 302
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 453 place count 339 transition count 302
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 529 place count 263 transition count 226
Iterating global reduction 3 with 76 rules applied. Total rules applied 605 place count 263 transition count 226
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 605 place count 263 transition count 219
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 621 place count 254 transition count 219
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 801 place count 163 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 162 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 805 place count 162 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 160 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 808 place count 160 transition count 132
Applied a total of 808 rules in 128 ms. Remains 160 /585 variables (removed 425) and now considering 132/528 (removed 396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 160/585 places, 132/528 transitions.
// Phase 1: matrix 132 rows 160 cols
[2023-03-14 11:18:53] [INFO ] Computed 69 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 43773 resets, run finished after 2417 ms. (steps per millisecond=413 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33757 ms.
ITS solved all properties within timeout

BK_STOP 1678792736520

--------------------
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="BusinessProcesses-PT-13"
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 BusinessProcesses-PT-13, 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 r043-tajo-167813697000549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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