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.r039-tajo-167813692700527.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 lolaxred
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678502727573

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:45:29] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-11 02:45:29] [INFO ] Transformed 518 places.
[2023-03-11 02:45:29] [INFO ] Transformed 471 transitions.
[2023-03-11 02:45:29] [INFO ] Found NUPN structural information;
[2023-03-11 02:45:29] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :4
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-11 02:45:30] [INFO ] Computed 85 place invariants in 43 ms
[2023-03-11 02:45:31] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 02:45:31] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-11 02:45:31] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-11 02:45:31] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 6 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 0 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1929 ms
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 604 ms
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 113 places in 161 ms of which 0 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:45:36] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:45:36] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:45:36] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:45:36] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 0 ms to minimize.
[2023-03-11 02:45:36] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:45:37] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:45:37] [INFO ] Deduced a trap composed of 129 places in 187 ms of which 0 ms to minimize.
[2023-03-11 02:45:37] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:45:37] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 2 ms to minimize.
[2023-03-11 02:45:37] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 5 ms to minimize.
[2023-03-11 02:45:38] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 0 ms to minimize.
[2023-03-11 02:45:38] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:45:38] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:45:38] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:45:38] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:45:40] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:45:40] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:45:40] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:45:40] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:45:41] [INFO ] Deduced a trap composed of 124 places in 185 ms of which 0 ms to minimize.
[2023-03-11 02:45:41] [INFO ] Deduced a trap composed of 117 places in 191 ms of which 10 ms to minimize.
[2023-03-11 02:45:41] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:45:41] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 2 ms to minimize.
[2023-03-11 02:45:42] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 1 ms to minimize.
[2023-03-11 02:45:42] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:45:42] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 4 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 0 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:45:44] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:45:44] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 1 ms to minimize.
[2023-03-11 02:45:44] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 2 ms to minimize.
[2023-03-11 02:45:45] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 0 ms to minimize.
[2023-03-11 02:45:45] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 2 ms to minimize.
[2023-03-11 02:45:45] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
[2023-03-11 02:45:45] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 11 ms to minimize.
[2023-03-11 02:45:45] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:45:46] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:45:46] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:45:46] [INFO ] Deduced a trap composed of 120 places in 192 ms of which 0 ms to minimize.
[2023-03-11 02:45:46] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:45:47] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-03-11 02:45:47] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:45:47] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2023-03-11 02:45:47] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:45:48] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:45:48] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:45:48] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 0 ms to minimize.
[2023-03-11 02:45:49] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:45:49] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:45:49] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 1 ms to minimize.
[2023-03-11 02:45:49] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:45:50] [INFO ] Deduced a trap composed of 127 places in 183 ms of which 1 ms to minimize.
[2023-03-11 02:45:50] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:45:51] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:45:51] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 1 ms to minimize.
[2023-03-11 02:45:51] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:45:51] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 0 ms to minimize.
[2023-03-11 02:45:51] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:45:52] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:45:52] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 0 ms to minimize.
[2023-03-11 02:45:52] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 1 ms to minimize.
[2023-03-11 02:45:53] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 1 ms to minimize.
[2023-03-11 02:45:53] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:45:54] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 0 ms to minimize.
[2023-03-11 02:45:54] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:45:54] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:45:55] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:45:55] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:45:56] [INFO ] Trap strengthening (SAT) tested/added 82/82 trap constraints in 21604 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-11 02:45:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:45:56] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 85 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 517 transition count 426
Reduce places removed 45 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 59 rules applied. Total rules applied 105 place count 472 transition count 412
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 458 transition count 412
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 119 place count 458 transition count 329
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 295 place count 365 transition count 329
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 340 place count 320 transition count 284
Iterating global reduction 3 with 45 rules applied. Total rules applied 385 place count 320 transition count 284
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 517 place count 254 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 518 place count 254 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 523 place count 254 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 524 place count 253 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 252 transition count 216
Applied a total of 525 rules in 138 ms. Remains 252 /518 variables (removed 266) and now considering 216/471 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 252/518 places, 216/471 transitions.
Incomplete random walk after 10000 steps, including 207 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 252 cols
[2023-03-11 02:45:56] [INFO ] Computed 73 place invariants in 19 ms
[2023-03-11 02:45:56] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:45:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-11 02:45:56] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-11 02:45:56] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-11 02:45:56] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-11 02:45:57] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:45:57] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:45:57] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2023-03-11 02:45:57] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-11 02:45:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 343 ms
[2023-03-11 02:45:57] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 02:45:57] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 216/216 transitions.
Graph (trivial) has 69 edges and 252 vertex of which 2 / 252 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 724 edges and 251 vertex of which 250 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 250 transition count 194
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 231 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 40 place count 231 transition count 180
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 71 place count 214 transition count 180
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 208 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 208 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 83 place count 208 transition count 173
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 207 transition count 173
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 73 rules applied. Total rules applied 158 place count 170 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 168 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 168 transition count 149
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 171 place count 163 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 163 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 162 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 161 transition count 147
Applied a total of 174 rules in 53 ms. Remains 161 /252 variables (removed 91) and now considering 147/216 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 161/252 places, 147/216 transitions.
Incomplete random walk after 10000 steps, including 233 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1053618 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :{}
Probabilistic random walk after 1053618 steps, saw 552802 distinct states, run finished after 3006 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 161 cols
[2023-03-11 02:46:00] [INFO ] Computed 68 place invariants in 6 ms
[2023-03-11 02:46:00] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:46:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-11 02:46:00] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-11 02:46:00] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:46:00] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-11 02:46:00] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 02:46:00] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 12 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 161/161 places, 147/147 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-11 02:46:00] [INFO ] Invariant cache hit.
[2023-03-11 02:46:00] [INFO ] Implicit Places using invariants in 117 ms returned [0, 4, 5, 6, 7, 8, 9, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 35, 37, 39, 41, 43, 45, 47, 52]
Discarding 27 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT only with invariants took 121 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/161 places, 133/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 130 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 130 transition count 117
Applied a total of 8 rules in 8 ms. Remains 130 /134 variables (removed 4) and now considering 117/133 (removed 16) transitions.
// Phase 1: matrix 117 rows 130 cols
[2023-03-11 02:46:00] [INFO ] Computed 43 place invariants in 3 ms
[2023-03-11 02:46:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 02:46:00] [INFO ] Invariant cache hit.
[2023-03-11 02:46:01] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [10, 81]
Discarding 2 places :
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Implicit Place search using SMT with State Equation took 232 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 128/161 places, 109/147 transitions.
Graph (complete) has 383 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 122 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 122 transition count 93
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 121 transition count 92
Applied a total of 11 rules in 14 ms. Remains 121 /128 variables (removed 7) and now considering 92/109 (removed 17) transitions.
// Phase 1: matrix 92 rows 121 cols
[2023-03-11 02:46:01] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:46:01] [INFO ] Implicit Places using invariants in 60 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 120/161 places, 92/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 446 ms. Remains : 120/161 places, 92/147 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 110 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=110 )
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 31782 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-10
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityFireability

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

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

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

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

FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

BK_STOP 1678502765437

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:147
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: 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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH INITIAL
lola: LAUNCH task # 4 (type CNST) for 3 BusinessProcesses-PT-10-ReachabilityFireability-01
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 4 (type CNST) for BusinessProcesses-PT-10-ReachabilityFireability-01
lola: result : false
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: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: LAUNCH task # 52 (type EXCL) for 9 BusinessProcesses-PT-10-ReachabilityFireability-03
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 54 (type FNDP) for 15 BusinessProcesses-PT-10-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 15 BusinessProcesses-PT-10-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type SRCH) for 15 BusinessProcesses-PT-10-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: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: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: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: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: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: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: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: FINISHED task # 54 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 291
lola: tried executions : 5
lola: time used : 0.000000
lola: memory pages used : 0
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: CANCELED task # 55 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 57 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 119 (type FNDP) for 27 BusinessProcesses-PT-10-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 120 (type EQUN) for 27 BusinessProcesses-PT-10-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 122 (type SRCH) for 27 BusinessProcesses-PT-10-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: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: FINISHED task # 122 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-09
lola: result : true
lola: markings : 46
lola: fired transitions : 71
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 119 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 120 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 93 (type FNDP) for 18 BusinessProcesses-PT-10-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 94 (type EQUN) for 18 BusinessProcesses-PT-10-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 96 (type SRCH) for 18 BusinessProcesses-PT-10-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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 # 119 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 188
lola: tried executions : 10
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 96 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-06
lola: result : true
lola: markings : 35
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 93 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 94 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 112 (type FNDP) for 0 BusinessProcesses-PT-10-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 113 (type EQUN) for 0 BusinessProcesses-PT-10-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 115 (type SRCH) for 0 BusinessProcesses-PT-10-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-55.sara.
lola: FINISHED task # 93 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-06
lola: result : true
lola: fired transitions : 33
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-120.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-94.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-113.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 19)

lola: FINISHED task # 55 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-05
lola: result : true

lola: FINISHED task # 113 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-00
lola: result : false
lola: CANCELED task # 112 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 115 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-00 (obsolete)
lola: LAUNCH task # 125 (type FNDP) for 42 BusinessProcesses-PT-10-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 126 (type EQUN) for 42 BusinessProcesses-PT-10-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 128 (type SRCH) for 42 BusinessProcesses-PT-10-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 112 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-00
lola: result : unknown
lola: fired transitions : 890291
lola: tried executions : 100251
lola: time used : 3.000000
lola: memory pages used : 0
lola: FINISHED task # 125 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 6
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 126 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 128 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 137 (type FNDP) for 39 BusinessProcesses-PT-10-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 138 (type EQUN) for 39 BusinessProcesses-PT-10-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 140 (type SRCH) for 39 BusinessProcesses-PT-10-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 137 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 91
lola: tried executions : 6
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 138 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 140 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 99 (type FNDP) for 24 BusinessProcesses-PT-10-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type EQUN) for 24 BusinessProcesses-PT-10-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 102 (type SRCH) for 24 BusinessProcesses-PT-10-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 99 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 8
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 100 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 102 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 73 (type FNDP) for 12 BusinessProcesses-PT-10-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 74 (type EQUN) for 12 BusinessProcesses-PT-10-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type SRCH) for 12 BusinessProcesses-PT-10-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-138.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-126.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-100.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-74.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 100 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-08
lola: result : true


lola: FINISHED task # 126 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-14
lola: result : true
lola: FINISHED task # 74 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-04
lola: result : false
lola: CANCELED task # 73 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 76 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-04 (obsolete)
lola: LAUNCH task # 86 (type FNDP) for 30 BusinessProcesses-PT-10-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 87 (type EQUN) for 30 BusinessProcesses-PT-10-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 89 (type SRCH) for 30 BusinessProcesses-PT-10-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 73 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-04
lola: result : unknown
lola: fired transitions : 33588
lola: tried executions : 3270
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 86 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 191
lola: tried executions : 32
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 87 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 89 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 79 (type FNDP) for 21 BusinessProcesses-PT-10-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 80 (type EQUN) for 21 BusinessProcesses-PT-10-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type SRCH) for 21 BusinessProcesses-PT-10-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 82 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-07
lola: result : true
lola: markings : 8
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 79 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 80 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 66 (type FNDP) for 33 BusinessProcesses-PT-10-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type EQUN) for 33 BusinessProcesses-PT-10-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 33 BusinessProcesses-PT-10-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 87 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-10
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 79 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 6
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-80.sara.
lola: FINISHED task # 66 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 5
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 67 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 69 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 106 (type FNDP) for 6 BusinessProcesses-PT-10-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 107 (type EQUN) for 6 BusinessProcesses-PT-10-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 109 (type SRCH) for 6 BusinessProcesses-PT-10-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 109 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-02
lola: result : true
lola: markings : 17
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 106 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 107 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-02 (obsolete)
lola: LAUNCH task # 131 (type FNDP) for 45 BusinessProcesses-PT-10-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 132 (type EQUN) for 45 BusinessProcesses-PT-10-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 134 (type SRCH) for 45 BusinessProcesses-PT-10-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 67 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-11
lola: result : unknown
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 # 131 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 7
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 132 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 134 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 60 (type FNDP) for 36 BusinessProcesses-PT-10-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type EQUN) for 36 BusinessProcesses-PT-10-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type SRCH) for 36 BusinessProcesses-PT-10-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 106 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 464
lola: tried executions : 82
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 80 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-07
lola: result : true
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-107.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-132.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 60 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-12
lola: result : true
lola: fired transitions : 268
lola: tried executions : 52
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 61 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 63 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 48 (type FNDP) for 9 BusinessProcesses-PT-10-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 9 BusinessProcesses-PT-10-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type SRCH) for 9 BusinessProcesses-PT-10-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-61.sara.

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: FINISHED task # 107 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-02
lola: result : true
lola: FINISHED task # 48 (type FNDP) for BusinessProcesses-PT-10-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 3337
lola: tried executions : 516
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 49 (type EQUN) for BusinessProcesses-PT-10-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 51 (type SRCH) for BusinessProcesses-PT-10-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 52 (type EXCL) for BusinessProcesses-PT-10-ReachabilityFireability-03 (obsolete)
lola: Portfolio finished: no open formulas

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


Time elapsed: 4 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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-10, 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 r039-tajo-167813692700527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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