Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900350.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716651326984

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:35:29] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-25 15:35:29] [INFO ] Transformed 624 places.
[2024-05-25 15:35:29] [INFO ] Transformed 564 transitions.
[2024-05-25 15:35:29] [INFO ] Found NUPN structural information;
[2024-05-25 15:35:29] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 556 rows 616 cols
[2024-05-25 15:35:30] [INFO ] Computed 99 invariants in 57 ms
[2024-05-25 15:35:31] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:35:32] [INFO ] [Nat]Absence check using 60 positive place invariants in 44 ms returned sat
[2024-05-25 15:35:32] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2024-05-25 15:35:33] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 12 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 10 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:35:36] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:35:37] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:35:38] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 1 ms to minimize.
[2024-05-25 15:35:38] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:38] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:35:38] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:35:38] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5142 ms
[2024-05-25 15:35:39] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2024-05-25 15:35:39] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:35:39] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:35:39] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:35:39] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 4 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:35:40] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2024-05-25 15:35:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1789 ms
[2024-05-25 15:35:41] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 1 ms to minimize.
[2024-05-25 15:35:41] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:35:41] [INFO ] Deduced a trap composed of 138 places in 232 ms of which 1 ms to minimize.
[2024-05-25 15:35:42] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 1 ms to minimize.
[2024-05-25 15:35:42] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2024-05-25 15:35:42] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:35:42] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 0 ms to minimize.
[2024-05-25 15:35:43] [INFO ] Deduced a trap composed of 149 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:35:43] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 1 ms to minimize.
[2024-05-25 15:35:43] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2024-05-25 15:35:43] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 2 ms to minimize.
[2024-05-25 15:35:44] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 1 ms to minimize.
[2024-05-25 15:35:44] [INFO ] Deduced a trap composed of 158 places in 238 ms of which 1 ms to minimize.
[2024-05-25 15:35:44] [INFO ] Deduced a trap composed of 145 places in 271 ms of which 1 ms to minimize.
[2024-05-25 15:35:44] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 2 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 1 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 153 places in 218 ms of which 1 ms to minimize.
[2024-05-25 15:35:45] [INFO ] Deduced a trap composed of 149 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 1 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 0 ms to minimize.
[2024-05-25 15:35:46] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 1 ms to minimize.
[2024-05-25 15:35:47] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:35:47] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:35:47] [INFO ] Deduced a trap composed of 132 places in 222 ms of which 0 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 0 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 1 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 148 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 0 ms to minimize.
[2024-05-25 15:35:48] [INFO ] Deduced a trap composed of 146 places in 206 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 149 places in 220 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:35:49] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:35:50] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 4 ms to minimize.
[2024-05-25 15:35:51] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 135 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:35:52] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:35:53] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 1 ms to minimize.
[2024-05-25 15:35:53] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:35:53] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:35:53] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:35:53] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 0 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:35:54] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 2 ms to minimize.
[2024-05-25 15:35:55] [INFO ] Deduced a trap composed of 118 places in 244 ms of which 1 ms to minimize.
[2024-05-25 15:35:56] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:35:56] [INFO ] Deduced a trap composed of 146 places in 170 ms of which 1 ms to minimize.
[2024-05-25 15:35:56] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 1 ms to minimize.
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:35:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:35:56] [INFO ] After 25155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 140 ms.
Support contains 88 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 610 transition count 486
Reduce places removed 69 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 76 rules applied. Total rules applied 146 place count 541 transition count 479
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 534 transition count 479
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 153 place count 534 transition count 362
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 400 place count 404 transition count 362
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 469 place count 335 transition count 293
Iterating global reduction 3 with 69 rules applied. Total rules applied 538 place count 335 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 538 place count 335 transition count 291
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 543 place count 332 transition count 291
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 667 place count 270 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 668 place count 270 transition count 228
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 669 place count 270 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 670 place count 269 transition count 227
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 675 place count 269 transition count 227
Applied a total of 675 rules in 176 ms. Remains 269 /616 variables (removed 347) and now considering 227/556 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 269/616 places, 227/556 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 395477 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{1=1, 2=1, 4=1}
Probabilistic random walk after 395477 steps, saw 73418 distinct states, run finished after 3003 ms. (steps per millisecond=131 ) properties seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 269 cols
[2024-05-25 15:36:01] [INFO ] Computed 80 invariants in 4 ms
[2024-05-25 15:36:01] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:36:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-25 15:36:01] [INFO ] [Nat]Absence check using 55 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-25 15:36:01] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:36:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:36:01] [INFO ] After 127ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:36:02] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:36:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1169 ms
[2024-05-25 15:36:03] [INFO ] After 1951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-25 15:36:03] [INFO ] After 2458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 36 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 227/227 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 269 transition count 221
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 263 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 262 transition count 220
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 14 place count 262 transition count 210
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 250 transition count 210
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 45 place count 241 transition count 201
Iterating global reduction 3 with 9 rules applied. Total rules applied 54 place count 241 transition count 201
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 115 place count 209 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 209 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 208 transition count 171
Applied a total of 117 rules in 79 ms. Remains 208 /269 variables (removed 61) and now considering 171/227 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 208/269 places, 171/227 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 978918 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 978918 steps, saw 182402 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 208 cols
[2024-05-25 15:36:07] [INFO ] Computed 75 invariants in 9 ms
[2024-05-25 15:36:07] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:36:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-25 15:36:07] [INFO ] [Nat]Absence check using 55 positive and 20 generalized place invariants in 8 ms returned sat
[2024-05-25 15:36:07] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:36:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 15:36:07] [INFO ] After 73ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:36:07] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-25 15:36:07] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 171/171 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 206 transition count 169
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 206 transition count 165
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 201 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 200 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 200 transition count 164
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 35 place count 190 transition count 154
Applied a total of 35 rules in 42 ms. Remains 190 /208 variables (removed 18) and now considering 154/171 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 190/208 places, 154/171 transitions.
Incomplete random walk after 10000 steps, including 466 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 536753 steps, run visited all 1 properties in 1595 ms. (steps per millisecond=336 )
Probabilistic random walk after 536753 steps, saw 107495 distinct states, run finished after 1595 ms. (steps per millisecond=336 ) properties seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 40248 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-14
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityFireability

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651371389

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:150
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 8 transitions removed,8 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH INITIAL
lola: LAUNCH task # 7 (type CNST) for 6 BusinessProcesses-PT-14-ReachabilityFireability-2024-02
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type CNST) for BusinessProcesses-PT-14-ReachabilityFireability-2024-02
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 53 (type EXCL) for 15 BusinessProcesses-PT-14-ReachabilityFireability-2024-05
lola: time limit : 163 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 15 BusinessProcesses-PT-14-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 15 BusinessProcesses-PT-14-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 15 BusinessProcesses-PT-14-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 49 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 19
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 50 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 52 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 53 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-05 (obsolete)
lola: LAUNCH task # 79 (type EXCL) for 12 BusinessProcesses-PT-14-ReachabilityFireability-2024-04
lola: time limit : 171 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 58 (type FNDP) for 18 BusinessProcesses-PT-14-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type EQUN) for 18 BusinessProcesses-PT-14-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type SRCH) for 18 BusinessProcesses-PT-14-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 79 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 1330
lola: fired transitions : 1657
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 65 (type EXCL) for 21 BusinessProcesses-PT-14-ReachabilityFireability-2024-07
lola: time limit : 179 sec
lola: memory limit: 32 pages
lola: FINISHED task # 58 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-06
lola: result : true
lola: fired transitions : 4
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 65 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-07
lola: result : true
lola: markings : 116
lola: fired transitions : 129
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 59 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-06 (obsolete)
lola: CANCELED task # 67 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-06 (obsolete)
lola: LAUNCH task # 78 (type EXCL) for 9 BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: time limit : 199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 70 (type FNDP) for 9 BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 72 (type EQUN) for 9 BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 77 (type SRCH) for 9 BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 78 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 70 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 72 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-03 (obsolete)
lola: CANCELED task # 77 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-03 (obsolete)
lola: FINISHED task # 70 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-03
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: Created skeleton in 0.000000 secs.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-59.sara.
lola: Created skeleton in 0.000000 secs.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-50.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-72.sara.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 88 (type EXCL) for 33 BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 82 (type FNDP) for 33 BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 83 (type EQUN) for 33 BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 87 (type SRCH) for 33 BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 88 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 82 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 83 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11 (obsolete)
lola: CANCELED task # 87 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11 (obsolete)
lola: LAUNCH task # 102 (type EXCL) for 45 BusinessProcesses-PT-14-ReachabilityFireability-2024-15
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 97 (type FNDP) for 30 BusinessProcesses-PT-14-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 99 (type EQUN) for 30 BusinessProcesses-PT-14-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 114 (type SRCH) for 30 BusinessProcesses-PT-14-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 87 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 82 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 114 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-10
lola: result : true
lola: markings : 27
lola: fired transitions : 26
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 97 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 99 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-10 (obsolete)
lola: LAUNCH task # 85 (type FNDP) for 0 BusinessProcesses-PT-14-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 92 (type EQUN) for 0 BusinessProcesses-PT-14-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 106 (type FNDP) for 24 BusinessProcesses-PT-14-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 97 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-10
lola: result : true
lola: fired transitions : 25
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 102 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 94
lola: fired transitions : 102
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 146 (type EXCL) for 3 BusinessProcesses-PT-14-ReachabilityFireability-2024-01
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 83 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-11
lola: result : unknown
lola: FINISHED task # 106 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-08
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 108 (type FNDP) for 39 BusinessProcesses-PT-14-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 85 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-00
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 92 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-00 (obsolete)
lola: LAUNCH task # 96 (type FNDP) for 36 BusinessProcesses-PT-14-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type EQUN) for 36 BusinessProcesses-PT-14-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 92 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-00
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 146 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 2454
lola: fired transitions : 3599
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 122 (type EXCL) for 27 BusinessProcesses-PT-14-ReachabilityFireability-2024-09
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 108 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-13
lola: result : true
lola: fired transitions : 71
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 113 (type FNDP) for 42 BusinessProcesses-PT-14-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-99.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-100.sara.
lola: FINISHED task # 122 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 137 (type EXCL) for 42 BusinessProcesses-PT-14-ReachabilityFireability-2024-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 113 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-14
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 137 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 131 (type EXCL) for 36 BusinessProcesses-PT-14-ReachabilityFireability-2024-12
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 130 (type SRCH) for 36 BusinessProcesses-PT-14-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 96 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 6006
lola: tried executions : 526
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 100 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 130 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 131 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-2024-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-14-ReachabilityFireability-2024-00: EF true findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-01: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-02: INITIAL true preprocessing
BusinessProcesses-PT-14-ReachabilityFireability-2024-03: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-04: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-05: AG false findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-06: AG false findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-07: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-08: EF true findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-09: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-10: EF true tandem / insertion
BusinessProcesses-PT-14-ReachabilityFireability-2024-11: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityFireability-2024-12: AG false findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-13: AG false findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-14: AG false findpath
BusinessProcesses-PT-14-ReachabilityFireability-2024-15: AG false tandem / relaxed


Time elapsed: 2 secs. Pages in use: 4

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;