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-167813692700559.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-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 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 156K 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678503362149

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-14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:56:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:56:03] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-11 02:56:03] [INFO ] Transformed 624 places.
[2023-03-11 02:56:03] [INFO ] Transformed 564 transitions.
[2023-03-11 02:56:03] [INFO ] Found NUPN structural information;
[2023-03-11 02:56:03] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-11 02:56:04] [INFO ] Computed 99 place invariants in 31 ms
[2023-03-11 02:56:05] [INFO ] [Real]Absence check using 60 positive place invariants in 21 ms returned sat
[2023-03-11 02:56:05] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-11 02:56:05] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 6 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 2 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 30 places in 626 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1844 ms
[2023-03-11 02:56:07] [INFO ] After 2112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:56:07] [INFO ] After 2618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:56:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 17 ms returned sat
[2023-03-11 02:56:07] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2023-03-11 02:56:08] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 0 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 147 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2796 ms
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 1 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1233 ms
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:56:13] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:56:14] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:56:15] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 0 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:56:16] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 4382 ms
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:56:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:56:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-11 02:56:18] [INFO ] After 10588ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 606 ms.
[2023-03-11 02:56:19] [INFO ] After 11518ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 124 ms.
Support contains 75 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.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 610 transition count 488
Reduce places removed 67 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 76 rules applied. Total rules applied 144 place count 543 transition count 479
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 153 place count 534 transition count 479
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 153 place count 534 transition count 366
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 388 place count 412 transition count 366
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 458 place count 342 transition count 296
Iterating global reduction 3 with 70 rules applied. Total rules applied 528 place count 342 transition count 296
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 528 place count 342 transition count 293
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 535 place count 338 transition count 293
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 685 place count 262 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 686 place count 262 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 261 transition count 218
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 692 place count 261 transition count 218
Applied a total of 692 rules in 112 ms. Remains 261 /616 variables (removed 355) and now considering 218/556 (removed 338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 261/616 places, 218/556 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 664824 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{0=1, 2=1, 5=1}
Probabilistic random walk after 664824 steps, saw 127562 distinct states, run finished after 3003 ms. (steps per millisecond=221 ) properties seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 218 rows 261 cols
[2023-03-11 02:56:22] [INFO ] Computed 82 place invariants in 6 ms
[2023-03-11 02:56:23] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:56:23] [INFO ] [Nat]Absence check using 54 positive place invariants in 15 ms returned sat
[2023-03-11 02:56:23] [INFO ] [Nat]Absence check using 54 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-11 02:56:23] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 5 ms to minimize.
[2023-03-11 02:56:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 383 ms
[2023-03-11 02:56:23] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-11 02:56:24] [INFO ] After 860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-11 02:56:24] [INFO ] After 1104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
Support contains 69 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 218/218 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 261 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 259 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 214
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 257 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 256 transition count 213
Applied a total of 10 rules in 50 ms. Remains 256 /261 variables (removed 5) and now considering 213/218 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 256/261 places, 213/218 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 256 cols
[2023-03-11 02:56:24] [INFO ] Computed 82 place invariants in 7 ms
[2023-03-11 02:56:24] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:56:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-11 02:56:24] [INFO ] [Nat]Absence check using 55 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-11 02:56:24] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:56:24] [INFO ] After 81ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-11 02:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-11 02:56:25] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-11 02:56:25] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 40 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 213/213 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 256 transition count 207
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 250 transition count 207
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 12 place count 250 transition count 195
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 41 place count 233 transition count 195
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 227 transition count 189
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 227 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 78 place count 214 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 213 transition count 176
Applied a total of 79 rules in 56 ms. Remains 213 /256 variables (removed 43) and now considering 176/213 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 213/256 places, 176/213 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336815 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336815 steps, saw 249497 distinct states, run finished after 3002 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 213 cols
[2023-03-11 02:56:28] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-11 02:56:28] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:56:28] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-11 02:56:28] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-11 02:56:28] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:56:28] [INFO ] After 143ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:28] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-11 02:56:28] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 213/213 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-11 02:56:28] [INFO ] Invariant cache hit.
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants in 136 ms returned [26, 27, 49, 51, 53, 55, 57, 59, 61, 63, 185]
Discarding 11 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 139 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/213 places, 174/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 161
Applied a total of 8 rules in 13 ms. Remains 198 /202 variables (removed 4) and now considering 161/174 (removed 13) transitions.
// Phase 1: matrix 161 rows 198 cols
[2023-03-11 02:56:29] [INFO ] Computed 67 place invariants in 2 ms
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-11 02:56:29] [INFO ] Invariant cache hit.
[2023-03-11 02:56:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [103, 105, 112, 114, 118, 119, 130, 132, 135, 136, 138]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 370 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/213 places, 161/176 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 152
Applied a total of 19 rules in 15 ms. Remains 177 /187 variables (removed 10) and now considering 152/161 (removed 9) transitions.
// Phase 1: matrix 152 rows 177 cols
[2023-03-11 02:56:29] [INFO ] Computed 55 place invariants in 4 ms
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 02:56:29] [INFO ] Invariant cache hit.
[2023-03-11 02:56:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [15, 18, 23, 24, 25, 26, 29, 30, 34]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 300 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/213 places, 150/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 146
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 167 transition count 146
Applied a total of 7 rules in 15 ms. Remains 167 /168 variables (removed 1) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 167 cols
[2023-03-11 02:56:29] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-11 02:56:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 02:56:29] [INFO ] Invariant cache hit.
[2023-03-11 02:56:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:56:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 167/213 places, 146/176 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1109 ms. Remains : 167/213 places, 146/176 transitions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1789196 steps, run timeout after 3002 ms. (steps per millisecond=596 ) properties seen :{}
Probabilistic random walk after 1789196 steps, saw 301093 distinct states, run finished after 3003 ms. (steps per millisecond=595 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:56:33] [INFO ] Invariant cache hit.
[2023-03-11 02:56:33] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:56:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-11 02:56:33] [INFO ] [Nat]Absence check using 36 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-11 02:56:33] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:56:33] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:33] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 02:56:33] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 11 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 167/167 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 10 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-11 02:56:33] [INFO ] Invariant cache hit.
[2023-03-11 02:56:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-11 02:56:33] [INFO ] Invariant cache hit.
[2023-03-11 02:56:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:56:33] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-11 02:56:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 02:56:33] [INFO ] Invariant cache hit.
[2023-03-11 02:56:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 167/167 places, 146/146 transitions.
Graph (complete) has 482 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 164 transition count 145
Applied a total of 3 rules in 8 ms. Remains 164 /167 variables (removed 3) and now considering 145/146 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 164 cols
[2023-03-11 02:56:33] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-11 02:56:33] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:56:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-11 02:56:33] [INFO ] [Nat]Absence check using 34 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-11 02:56:34] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:34] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 02:56:34] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-11 02:56:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 146 transitions and 609 arcs took 1 ms.
[2023-03-11 02:56:34] [INFO ] Flatten gal took : 35 ms
Total runtime 30660 ms.
There are residual formulas that ITS could not solve within timeout
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/373
ReachabilityFireability

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

BK_STOP 1678503394865

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
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: LAUNCH task # 7 (type EXCL) for 0 BusinessProcesses-PT-14-ReachabilityFireability-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 BusinessProcesses-PT-14-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 BusinessProcesses-PT-14-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 BusinessProcesses-PT-14-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-14-ReachabilityFireability-09
lola: result : true
lola: markings : 36147
lola: fired transitions : 57102
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for BusinessProcesses-PT-14-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 4 (type EQUN) for BusinessProcesses-PT-14-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 6 (type SRCH) for BusinessProcesses-PT-14-ReachabilityFireability-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-14-ReachabilityFireability-09: EF true tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

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="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-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 r039-tajo-167813692700559"
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 ;