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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 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 141K 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-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678502766537

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:46:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:46:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:46:08] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 02:46:08] [INFO ] Transformed 567 places.
[2023-03-11 02:46:08] [INFO ] Transformed 508 transitions.
[2023-03-11 02:46:08] [INFO ] Found NUPN structural information;
[2023-03-11 02:46:08] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
Support contains 110 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 58 place count 502 transition count 447
Iterating global reduction 1 with 54 rules applied. Total rules applied 112 place count 502 transition count 447
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 134 place count 480 transition count 425
Iterating global reduction 1 with 22 rules applied. Total rules applied 156 place count 480 transition count 425
Applied a total of 156 rules in 91 ms. Remains 480 /560 variables (removed 80) and now considering 425/501 (removed 76) transitions.
// Phase 1: matrix 425 rows 480 cols
[2023-03-11 02:46:08] [INFO ] Computed 91 place invariants in 28 ms
[2023-03-11 02:46:08] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 02:46:08] [INFO ] Invariant cache hit.
[2023-03-11 02:46:09] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-11 02:46:09] [INFO ] Invariant cache hit.
[2023-03-11 02:46:09] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 480/560 places, 425/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1064 ms. Remains : 480/560 places, 425/501 transitions.
Support contains 110 out of 480 places after structural reductions.
[2023-03-11 02:46:09] [INFO ] Flatten gal took : 69 ms
[2023-03-11 02:46:09] [INFO ] Flatten gal took : 34 ms
[2023-03-11 02:46:09] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 79) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-11 02:46:10] [INFO ] Invariant cache hit.
[2023-03-11 02:46:10] [INFO ] [Real]Absence check using 49 positive place invariants in 13 ms returned sat
[2023-03-11 02:46:10] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-11 02:46:11] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:49
[2023-03-11 02:46:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2023-03-11 02:46:11] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 14 ms returned sat
[2023-03-11 02:46:12] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :41
[2023-03-11 02:46:12] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 6 ms to minimize.
[2023-03-11 02:46:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:46:12] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-11 02:46:12] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:46:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 380 ms
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 0 ms to minimize.
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 1 ms to minimize.
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:46:13] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:46:14] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 1 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:46:15] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:46:16] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 0 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 6 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 0 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:46:17] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:46:18] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:46:18] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 5062 ms
[2023-03-11 02:46:18] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2023-03-11 02:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-11 02:46:18] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:46:19] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:46:20] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:46:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1279 ms
[2023-03-11 02:46:20] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:46:20] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:46:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-11 02:46:20] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:46:21] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 2 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:46:22] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 2 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:46:23] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3223 ms
[2023-03-11 02:46:24] [INFO ] After 12463ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :41
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2023-03-11 02:46:25] [INFO ] After 14233ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :41
Fused 50 Parikh solutions to 41 different solutions.
Parikh walk visited 10 properties in 639 ms.
Support contains 50 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 479 transition count 385
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 440 transition count 381
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 436 transition count 381
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 87 place count 436 transition count 288
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 289 place count 327 transition count 288
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 302 place count 314 transition count 275
Iterating global reduction 3 with 13 rules applied. Total rules applied 315 place count 314 transition count 275
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 512 place count 214 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 513 place count 214 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 515 place count 213 transition count 181
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 524 place count 213 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 525 place count 212 transition count 180
Applied a total of 525 rules in 97 ms. Remains 212 /480 variables (removed 268) and now considering 180/425 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 212/480 places, 180/425 transitions.
Incomplete random walk after 10000 steps, including 565 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Interrupted probabilistic random walk after 699781 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{0=1, 3=1, 4=1, 5=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1}
Probabilistic random walk after 699781 steps, saw 115372 distinct states, run finished after 3004 ms. (steps per millisecond=232 ) properties seen :26
Running SMT prover for 5 properties.
// Phase 1: matrix 180 rows 212 cols
[2023-03-11 02:46:29] [INFO ] Computed 72 place invariants in 4 ms
[2023-03-11 02:46:29] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2023-03-11 02:46:29] [INFO ] [Real]Absence check using 52 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-11 02:46:29] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-11 02:46:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:46:29] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:46:29] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:46:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-11 02:46:29] [INFO ] [Nat]Absence check using 52 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-11 02:46:30] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:46:30] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 02:46:30] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-11 02:46:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-11 02:46:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-11 02:46:30] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 17 ms to minimize.
[2023-03-11 02:46:30] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2023-03-11 02:46:30] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:46:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-03-11 02:46:30] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 02:46:30] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 15 ms.
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 180/180 transitions.
Graph (trivial) has 38 edges and 212 vertex of which 2 / 212 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 211 transition count 169
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 202 transition count 169
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 19 place count 202 transition count 159
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 41 place count 190 transition count 159
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 184 transition count 153
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 184 transition count 153
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 84 place count 168 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 168 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 166 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 166 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 165 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 165 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 164 transition count 134
Applied a total of 92 rules in 41 ms. Remains 164 /212 variables (removed 48) and now considering 134/180 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 164/212 places, 134/180 transitions.
Incomplete random walk after 10000 steps, including 467 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 194 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 194 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Finished probabilistic random walk after 15347 steps, run visited all 5 properties in 120 ms. (steps per millisecond=127 )
Probabilistic random walk after 15347 steps, saw 4690 distinct states, run finished after 120 ms. (steps per millisecond=127 ) properties seen :5
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-11-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 46 ms
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:46:31] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 93 out of 480 places (down from 94) after GAL structural reductions.
Computed a total of 465 stabilizing places and 410 stable transitions
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 453 transition count 398
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 453 transition count 398
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 440 transition count 385
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 440 transition count 385
Applied a total of 80 rules in 26 ms. Remains 440 /480 variables (removed 40) and now considering 385/425 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 440/480 places, 385/425 transitions.
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:46:31] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 459 transition count 404
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 459 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 448 transition count 393
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 448 transition count 393
Applied a total of 64 rules in 55 ms. Remains 448 /480 variables (removed 32) and now considering 393/425 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 448/480 places, 393/425 transitions.
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 20 ms
[2023-03-11 02:46:31] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:46:31] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 456 transition count 401
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 456 transition count 401
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 444 transition count 389
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 68 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 17 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 17 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 228 edges and 480 vertex of which 4 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 475 transition count 355
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 410 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 409 transition count 354
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 134 place count 409 transition count 265
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 328 place count 304 transition count 265
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 352 place count 280 transition count 241
Iterating global reduction 3 with 24 rules applied. Total rules applied 376 place count 280 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 280 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 278 transition count 239
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 585 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 586 place count 174 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 173 transition count 136
Applied a total of 587 rules in 70 ms. Remains 173 /480 variables (removed 307) and now considering 136/425 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 173/480 places, 136/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 473 transition count 351
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 136 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 342 place count 294 transition count 256
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 368 place count 268 transition count 230
Iterating global reduction 3 with 26 rules applied. Total rules applied 394 place count 268 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 394 place count 268 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 398 place count 266 transition count 228
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 59 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 226 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 473 transition count 358
Reduce places removed 59 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 414 transition count 355
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 411 transition count 355
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 126 place count 411 transition count 264
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 324 place count 304 transition count 264
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 349 place count 279 transition count 239
Iterating global reduction 3 with 25 rules applied. Total rules applied 374 place count 279 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 279 transition count 237
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 378 place count 277 transition count 237
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 587 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 588 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 169 transition count 133
Applied a total of 589 rules in 47 ms. Remains 169 /480 variables (removed 311) and now considering 133/425 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 169/480 places, 133/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 7 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 8 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 455 transition count 400
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 455 transition count 400
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 444 transition count 389
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 19 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 233 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 473 transition count 352
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 408 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 408 transition count 257
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 270 transition count 232
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 270 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 390 place count 270 transition count 231
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 593 place count 167 transition count 132
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 599 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 600 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 601 place count 165 transition count 131
Applied a total of 601 rules in 43 ms. Remains 165 /480 variables (removed 315) and now considering 131/425 (removed 294) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 165/480 places, 131/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 23 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 10 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 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 69 place count 473 transition count 350
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 136 place count 406 transition count 257
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 366 place count 269 transition count 231
Iterating global reduction 2 with 26 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 392 place count 269 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 267 transition count 229
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 35 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 230 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 473 transition count 353
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 409 transition count 353
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 130 place count 409 transition count 261
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 330 place count 301 transition count 261
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 355 place count 276 transition count 236
Iterating global reduction 2 with 25 rules applied. Total rules applied 380 place count 276 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 380 place count 276 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 275 transition count 235
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 589 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 132
Applied a total of 591 rules in 37 ms. Remains 168 /480 variables (removed 312) and now considering 132/425 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 168/480 places, 132/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 454 transition count 399
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 454 transition count 399
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 441 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 441 transition count 386
Applied a total of 78 rules in 20 ms. Remains 441 /480 variables (removed 39) and now considering 386/425 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 441/480 places, 386/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 10 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 478 transition count 374
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 429 transition count 371
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 426 transition count 371
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 105 place count 426 transition count 263
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 339 place count 300 transition count 263
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 362 place count 277 transition count 240
Iterating global reduction 3 with 23 rules applied. Total rules applied 385 place count 277 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 277 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 276 transition count 239
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 596 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 602 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 168 transition count 135
Applied a total of 604 rules in 41 ms. Remains 168 /480 variables (removed 312) and now considering 135/425 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 168/480 places, 135/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 5 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 6 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 19 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 10 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 17 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:46:32] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-11 02:46:32] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:46:33] [INFO ] Flatten gal took : 12 ms
[2023-03-11 02:46:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 02:46:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 425 transitions and 1342 arcs took 3 ms.
Total runtime 24986 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-11
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
CTLFireability

FORMULA BusinessProcesses-PT-11-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-11-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678502934286

--------------------
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 CTLFireability -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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:394
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:451
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:478
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:388
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: RELEASE
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: 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: 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: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 61 (type EXCL) for 12 BusinessProcesses-PT-11-CTLFireability-04
lola: time limit : 138 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: FINISHED task # 61 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-04
lola: result : true
lola: markings : 13368
lola: fired transitions : 35974
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-11-CTLFireability-01
lola: time limit : 144 sec
lola: memory limit: 32 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: LAUNCH task # 62 (type FNDP) for 41 BusinessProcesses-PT-11-CTLFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type EQUN) for 41 BusinessProcesses-PT-11-CTLFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 65 (type SRCH) for 41 BusinessProcesses-PT-11-CTLFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 65 (type SRCH) for BusinessProcesses-PT-11-CTLFireability-12
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 62 (type FNDP) for BusinessProcesses-PT-11-CTLFireability-12
lola: result : true
lola: fired transitions : 4
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: Created skeleton in 0.000000 secs.
lola: CANCELED task # 63 (type EQUN) for BusinessProcesses-PT-11-CTLFireability-12 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: LAUNCH task # 70 (type FNDP) for 28 BusinessProcesses-PT-11-CTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 70 (type FNDP) for BusinessProcesses-PT-11-CTLFireability-09
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-01
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: result : true
lola: markings : 2385
lola: fired transitions : 4539
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 67 (type EXCL) for 48 BusinessProcesses-PT-11-CTLFireability-13
lola: time limit : 225 sec
lola: memory limit: 32 pages
lola: FINISHED task # 63 (type EQUN) for BusinessProcesses-PT-11-CTLFireability-12
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 72 (type FNDP) for 21 BusinessProcesses-PT-11-CTLFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 73 (type EQUN) for 21 BusinessProcesses-PT-11-CTLFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 75 (type SRCH) for 21 BusinessProcesses-PT-11-CTLFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 75 (type SRCH) for BusinessProcesses-PT-11-CTLFireability-08
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
sara: try reading problem file /home/mcc/execution/376/CTLFireability-73.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:812

lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: FINISHED task # 73 (type EQUN) for BusinessProcesses-PT-11-CTLFireability-08
lola: result : true
lola: CANCELED task # 72 (type FNDP) for BusinessProcesses-PT-11-CTLFireability-08 (obsolete)
lola: FINISHED task # 72 (type FNDP) for BusinessProcesses-PT-11-CTLFireability-08
lola: result : unknown
lola: fired transitions : 17352
lola: tried executions : 3616
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 67 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-13
lola: result : true
lola: markings : 27874
lola: fired transitions : 57883
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 54 (type EXCL) for 51 BusinessProcesses-PT-11-CTLFireability-14
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: FINISHED task # 54 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-14
lola: result : false
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 46 (type EXCL) for 41 BusinessProcesses-PT-11-CTLFireability-12
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 46 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-12
lola: result : true
lola: markings : 251
lola: fired transitions : 252
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 18 BusinessProcesses-PT-11-CTLFireability-07
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: FINISHED task # 19 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-07
lola: result : false
lola: markings : 2271
lola: fired transitions : 4915
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-11-CTLFireability-02
lola: time limit : 449 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 4/449 2/32 BusinessProcesses-PT-11-CTLFireability-02 212515 m, 42503 m/sec, 1888570 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 9/449 3/32 BusinessProcesses-PT-11-CTLFireability-02 436916 m, 44880 m/sec, 4108293 t fired, .

Time elapsed: 10 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 14/449 4/32 BusinessProcesses-PT-11-CTLFireability-02 665496 m, 45716 m/sec, 6381239 t fired, .

Time elapsed: 15 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 19/449 6/32 BusinessProcesses-PT-11-CTLFireability-02 877026 m, 42306 m/sec, 8665861 t fired, .

Time elapsed: 20 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 24/449 7/32 BusinessProcesses-PT-11-CTLFireability-02 1084201 m, 41435 m/sec, 10761105 t fired, .

Time elapsed: 25 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 29/449 8/32 BusinessProcesses-PT-11-CTLFireability-02 1293762 m, 41912 m/sec, 13009212 t fired, .

Time elapsed: 30 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 34/449 9/32 BusinessProcesses-PT-11-CTLFireability-02 1503800 m, 42007 m/sec, 15291029 t fired, .

Time elapsed: 35 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 39/449 11/32 BusinessProcesses-PT-11-CTLFireability-02 1698645 m, 38969 m/sec, 17563524 t fired, .

Time elapsed: 40 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 44/449 12/32 BusinessProcesses-PT-11-CTLFireability-02 1905812 m, 41433 m/sec, 19846002 t fired, .

Time elapsed: 45 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 49/449 13/32 BusinessProcesses-PT-11-CTLFireability-02 2111549 m, 41147 m/sec, 22003847 t fired, .

Time elapsed: 50 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 54/449 14/32 BusinessProcesses-PT-11-CTLFireability-02 2318524 m, 41395 m/sec, 24227102 t fired, .

Time elapsed: 55 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 59/449 15/32 BusinessProcesses-PT-11-CTLFireability-02 2522793 m, 40853 m/sec, 26502599 t fired, .

Time elapsed: 60 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 64/449 17/32 BusinessProcesses-PT-11-CTLFireability-02 2714225 m, 38286 m/sec, 28767533 t fired, .

Time elapsed: 65 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 69/449 18/32 BusinessProcesses-PT-11-CTLFireability-02 2934870 m, 44129 m/sec, 31032544 t fired, .

Time elapsed: 70 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 74/449 19/32 BusinessProcesses-PT-11-CTLFireability-02 3148169 m, 42659 m/sec, 33323996 t fired, .

Time elapsed: 75 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 79/449 20/32 BusinessProcesses-PT-11-CTLFireability-02 3348071 m, 39980 m/sec, 35507846 t fired, .

Time elapsed: 80 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 84/449 21/32 BusinessProcesses-PT-11-CTLFireability-02 3539343 m, 38254 m/sec, 37738152 t fired, .

Time elapsed: 85 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 89/449 23/32 BusinessProcesses-PT-11-CTLFireability-02 3728902 m, 37911 m/sec, 39899069 t fired, .

Time elapsed: 90 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 94/449 24/32 BusinessProcesses-PT-11-CTLFireability-02 3928636 m, 39946 m/sec, 42168051 t fired, .

Time elapsed: 95 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 99/449 25/32 BusinessProcesses-PT-11-CTLFireability-02 4103080 m, 34888 m/sec, 44244956 t fired, .

Time elapsed: 100 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 104/449 26/32 BusinessProcesses-PT-11-CTLFireability-02 4284454 m, 36274 m/sec, 46397638 t fired, .

Time elapsed: 105 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 109/449 27/32 BusinessProcesses-PT-11-CTLFireability-02 4463380 m, 35785 m/sec, 48664957 t fired, .

Time elapsed: 110 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 114/449 28/32 BusinessProcesses-PT-11-CTLFireability-02 4636766 m, 34677 m/sec, 50772363 t fired, .

Time elapsed: 115 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 119/449 29/32 BusinessProcesses-PT-11-CTLFireability-02 4827167 m, 38080 m/sec, 52908677 t fired, .

Time elapsed: 120 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 124/449 30/32 BusinessProcesses-PT-11-CTLFireability-02 5004845 m, 35535 m/sec, 55016088 t fired, .

Time elapsed: 125 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 129/449 31/32 BusinessProcesses-PT-11-CTLFireability-02 5194102 m, 37851 m/sec, 57280844 t fired, .

Time elapsed: 130 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 15
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 CTL EXCL 134/449 32/32 BusinessProcesses-PT-11-CTLFireability-02 5372471 m, 35673 m/sec, 59535089 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
lola: CANCELED task # 7 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-11-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
BusinessProcesses-PT-11-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-10: EGEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-11-CTLFireability-14: DISJ 0 1 0 0 3 0 0 0
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 15
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-11-CTLFireability-00
lola: time limit : 494 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-00
lola: result : false
lola: markings : 426
lola: fired transitions : 732
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 56 (type EXCL) for 51 BusinessProcesses-PT-11-CTLFireability-14
lola: time limit : 576 sec
lola: memory limit: 32 pages
lola: FINISHED task # 56 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-14
lola: result : false
lola: markings : 425
lola: fired transitions : 739
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 36 (type EXCL) for 35 BusinessProcesses-PT-11-CTLFireability-10
lola: time limit : 692 sec
lola: memory limit: 32 pages
lola: FINISHED task # 36 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-10
lola: result : true
lola: markings : 150
lola: fired transitions : 240
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 76 (type EXCL) for 58 BusinessProcesses-PT-11-CTLFireability-15
lola: time limit : 865 sec
lola: memory limit: 32 pages
lola: FINISHED task # 76 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-15
lola: result : false
lola: markings : 196
lola: fired transitions : 196
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 BusinessProcesses-PT-11-CTLFireability-06
lola: time limit : 1153 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-06
lola: result : true
lola: markings : 37
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 39 (type EXCL) for 38 BusinessProcesses-PT-11-CTLFireability-11
lola: time limit : 1730 sec
lola: memory limit: 32 pages
lola: FINISHED task # 39 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-11
lola: result : false
lola: markings : 29364
lola: fired transitions : 293192
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 BusinessProcesses-PT-11-CTLFireability-03
lola: time limit : 3459 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-11-CTLFireability-03
lola: result : false
lola: markings : 81
lola: fired transitions : 184
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 15

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-11-CTLFireability-00: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-02: CTL unknown AGGR
BusinessProcesses-PT-11-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-04: EFAG false tscc_search
BusinessProcesses-PT-11-CTLFireability-06: CTL true CTL model checker
BusinessProcesses-PT-11-CTLFireability-07: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-08: CONJ false state equation
BusinessProcesses-PT-11-CTLFireability-09: DISJ true findpath
BusinessProcesses-PT-11-CTLFireability-10: EGEF true CTL model checker
BusinessProcesses-PT-11-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-11-CTLFireability-12: CONJ true CONJ
BusinessProcesses-PT-11-CTLFireability-13: SP ECTL false LTL model checker
BusinessProcesses-PT-11-CTLFireability-14: DISJ false DISJ
BusinessProcesses-PT-11-CTLFireability-15: SP ACTL false LTL model checker


Time elapsed: 141 secs. Pages in use: 32

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-11"
export BK_EXAMINATION="CTLFireability"
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-11, examination is CTLFireability"
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-167813692700530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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