About the Execution of ITS-Tools for BusinessProcesses-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 375.676 | 38444.00 | 54318.00 | 80.60 | 0 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/mcc2023-input.r037-tajo-167813690600597.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 itstools
Input is BusinessProcesses-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 25K 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 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 189K 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-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678364624483
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 12:23:46] [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]
[2023-03-09 12:23:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:23:46] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-09 12:23:46] [INFO ] Transformed 772 places.
[2023-03-09 12:23:46] [INFO ] Transformed 685 transitions.
[2023-03-09 12:23:46] [INFO ] Found NUPN structural information;
[2023-03-09 12:23:46] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 15 places in 25 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 670 rows 757 cols
[2023-03-09 12:23:46] [INFO ] Computed 125 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :8
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
[2023-03-09 12:23:46] [INFO ] Invariant cache hit.
[2023-03-09 12:23:47] [INFO ] [Real]Absence check using 78 positive place invariants in 37 ms returned sat
[2023-03-09 12:23:47] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-09 12:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:47] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-09 12:23:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:23:47] [INFO ] [Nat]Absence check using 78 positive place invariants in 23 ms returned sat
[2023-03-09 12:23:47] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-09 12:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:47] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-09 12:23:48] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 3 ms to minimize.
[2023-03-09 12:23:48] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-09 12:23:48] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:23:48] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 12 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2023-03-09 12:23:49] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 0 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 0 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:23:50] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 0 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:23:51] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 13 ms to minimize.
[2023-03-09 12:23:52] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 1 ms to minimize.
[2023-03-09 12:23:52] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:23:52] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:23:52] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:23:52] [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: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-09 12:23:52] [INFO ] [Real]Absence check using 78 positive place invariants in 21 ms returned sat
[2023-03-09 12:23:52] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2023-03-09 12:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:52] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-09 12:23:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:23:53] [INFO ] [Nat]Absence check using 78 positive place invariants in 22 ms returned sat
[2023-03-09 12:23:53] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-09 12:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:53] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-09 12:23:53] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:23:53] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:23:53] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-09 12:23:53] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:23:54] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2023-03-09 12:23:54] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2023-03-09 12:23:54] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-09 12:23:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 959 ms
[2023-03-09 12:23:54] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 45 ms.
[2023-03-09 12:23:56] [INFO ] Added : 312 causal constraints over 63 iterations in 2587 ms. Result :sat
Minimization took 151 ms.
[2023-03-09 12:23:57] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2023-03-09 12:23:57] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2023-03-09 12:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:57] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-09 12:23:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:23:57] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2023-03-09 12:23:57] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-09 12:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:23:57] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-09 12:23:58] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2023-03-09 12:23:58] [INFO ] Deduced a trap composed of 155 places in 224 ms of which 5 ms to minimize.
[2023-03-09 12:23:58] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2023-03-09 12:23:58] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 0 ms to minimize.
[2023-03-09 12:23:59] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-09 12:23:59] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-09 12:23:59] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 0 ms to minimize.
[2023-03-09 12:23:59] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 1 ms to minimize.
[2023-03-09 12:24:00] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-03-09 12:24:00] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 0 ms to minimize.
[2023-03-09 12:24:00] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2023-03-09 12:24:00] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 0 ms to minimize.
[2023-03-09 12:24:00] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-09 12:24:01] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-09 12:24:01] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2023-03-09 12:24:01] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-09 12:24:01] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-09 12:24:02] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 2 ms to minimize.
[2023-03-09 12:24:02] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2023-03-09 12:24:02] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 1 ms to minimize.
[2023-03-09 12:24:02] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:24:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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-09 12:24:02] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2023-03-09 12:24:02] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-09 12:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:02] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-09 12:24:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:24:03] [INFO ] [Nat]Absence check using 78 positive place invariants in 48 ms returned sat
[2023-03-09 12:24:03] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 12:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:03] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-09 12:24:03] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-09 12:24:04] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 1 ms to minimize.
[2023-03-09 12:24:04] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:24:04] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 0 ms to minimize.
[2023-03-09 12:24:04] [INFO ] Deduced a trap composed of 130 places in 186 ms of which 1 ms to minimize.
[2023-03-09 12:24:04] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 0 ms to minimize.
[2023-03-09 12:24:05] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 0 ms to minimize.
[2023-03-09 12:24:05] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 1 ms to minimize.
[2023-03-09 12:24:05] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 0 ms to minimize.
[2023-03-09 12:24:05] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 1 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 130 places in 247 ms of which 1 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 2 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 0 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 2 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 2 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 152 places in 214 ms of which 2 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 0 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 0 ms to minimize.
[2023-03-09 12:24:08] [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-09 12:24:08] [INFO ] [Real]Absence check using 78 positive place invariants in 21 ms returned sat
[2023-03-09 12:24:08] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-09 12:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:08] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-09 12:24:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:24:08] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2023-03-09 12:24:08] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-09 12:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:08] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 0 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:24:10] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:24:10] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:24:10] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2023-03-09 12:24:10] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 0 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 1 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-03-09 12:24:11] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-09 12:24:12] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3641 ms
[2023-03-09 12:24:12] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 36 ms.
[2023-03-09 12:24:13] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 0 ms to minimize.
[2023-03-09 12:24:13] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:24:13] [INFO ] [Real]Absence check using 78 positive place invariants in 21 ms returned sat
[2023-03-09 12:24:13] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-09 12:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:14] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-09 12:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:24:14] [INFO ] [Nat]Absence check using 78 positive place invariants in 25 ms returned sat
[2023-03-09 12:24:14] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 11 ms returned sat
[2023-03-09 12:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:24:14] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-09 12:24:14] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:24:14] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2023-03-09 12:24:14] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2023-03-09 12:24:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1281 ms
[2023-03-09 12:24:15] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 49 ms.
[2023-03-09 12:24:18] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:24:18] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-09 12:24:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-03-09 12:24:18] [INFO ] Added : 287 causal constraints over 58 iterations in 2746 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 433 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 742 transition count 490
Reduce places removed 171 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 174 rules applied. Total rules applied 347 place count 571 transition count 487
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 350 place count 568 transition count 487
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 350 place count 568 transition count 375
Deduced a syphon composed of 112 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 597 place count 433 transition count 375
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 694 place count 336 transition count 278
Iterating global reduction 3 with 97 rules applied. Total rules applied 791 place count 336 transition count 278
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 791 place count 336 transition count 269
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 812 place count 324 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 813 place count 323 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 323 transition count 268
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1054 place count 202 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1056 place count 201 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1058 place count 201 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1060 place count 199 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1061 place count 199 transition count 150
Applied a total of 1061 rules in 207 ms. Remains 199 /757 variables (removed 558) and now considering 150/670 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 199/757 places, 150/670 transitions.
// Phase 1: matrix 150 rows 199 cols
[2023-03-09 12:24:19] [INFO ] Computed 89 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 48181 resets, run finished after 3298 ms. (steps per millisecond=303 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36122 ms.
BK_STOP 1678364662927
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-19"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-19, 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 r037-tajo-167813690600597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 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 ;