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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678503755267

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-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:02:36] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-11 03:02:36] [INFO ] Transformed 782 places.
[2023-03-11 03:02:36] [INFO ] Transformed 697 transitions.
[2023-03-11 03:02:36] [INFO ] Found NUPN structural information;
[2023-03-11 03:02:36] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 14 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 103 place count 616 transition count 549
Iterating global reduction 1 with 89 rules applied. Total rules applied 192 place count 616 transition count 549
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 230 place count 578 transition count 511
Iterating global reduction 1 with 38 rules applied. Total rules applied 268 place count 578 transition count 511
Applied a total of 268 rules in 111 ms. Remains 578 /719 variables (removed 141) and now considering 511/638 (removed 127) transitions.
// Phase 1: matrix 511 rows 578 cols
[2023-03-11 03:02:37] [INFO ] Computed 107 place invariants in 29 ms
[2023-03-11 03:02:37] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-11 03:02:37] [INFO ] Invariant cache hit.
[2023-03-11 03:02:37] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2023-03-11 03:02:37] [INFO ] Invariant cache hit.
[2023-03-11 03:02:38] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/719 places, 511/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 578/719 places, 511/638 transitions.
Support contains 99 out of 578 places after structural reductions.
[2023-03-11 03:02:38] [INFO ] Flatten gal took : 49 ms
[2023-03-11 03:02:38] [INFO ] Flatten gal took : 29 ms
[2023-03-11 03:02:38] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 94 out of 578 places (down from 99) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 58) seen :27
Incomplete Best-First random walk after 1000 steps, including 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Running SMT prover for 31 properties.
[2023-03-11 03:02:39] [INFO ] Invariant cache hit.
[2023-03-11 03:02:39] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-11 03:02:39] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-11 03:02:39] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-11 03:02:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-11 03:02:40] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 7 ms returned sat
[2023-03-11 03:02:40] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :29
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 9 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1176 ms
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 486 ms
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 114 places in 158 ms of which 1 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 0 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 0 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 1 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 0 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 1 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:02:44] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 1 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 1 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 0 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 0 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 1 ms to minimize.
[2023-03-11 03:02:45] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 1 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 1 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 3 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 0 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 2 ms to minimize.
[2023-03-11 03:02:46] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 1 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:02:47] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 0 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 6 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 120 places in 102 ms of which 1 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 0 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 3 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 2 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 122 places in 94 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 0 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 117 places in 106 ms of which 0 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 0 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 1 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2023-03-11 03:02:52] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 1 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 0 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 106 places in 87 ms of which 1 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 0 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 0 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 0 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 0 ms to minimize.
[2023-03-11 03:02:53] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 0 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 0 ms to minimize.
[2023-03-11 03:02:56] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:02:56] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 1 ms to minimize.
[2023-03-11 03:02:56] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:02:56] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 1 ms to minimize.
[2023-03-11 03:02:56] [INFO ] Deduced a trap composed of 120 places in 164 ms of which 1 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 0 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 1 ms to minimize.
[2023-03-11 03:02:57] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 1 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 0 ms to minimize.
[2023-03-11 03:02:58] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 1 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 1 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 1 ms to minimize.
[2023-03-11 03:03:00] [INFO ] Deduced a trap composed of 103 places in 168 ms of which 1 ms to minimize.
[2023-03-11 03:03:00] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 0 ms to minimize.
[2023-03-11 03:03:00] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 0 ms to minimize.
[2023-03-11 03:03:00] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:03:00] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 0 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 1 ms to minimize.
[2023-03-11 03:03:01] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 0 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 115 places in 119 ms of which 0 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 0 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 0 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 1 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:03:02] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 1 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 146 places in 106 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 1 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 121 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 1 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 0 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 2 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 5 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 1 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-11 03:03:04] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:03:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:03:04] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:31
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 753 ms.
Support contains 40 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 248 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1257 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 569 transition count 434
Reduce places removed 66 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 74 rules applied. Total rules applied 142 place count 503 transition count 426
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 150 place count 495 transition count 426
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 150 place count 495 transition count 333
Deduced a syphon composed of 93 places in 2 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 352 place count 386 transition count 333
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 366 place count 372 transition count 319
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 372 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 380 place count 372 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 382 place count 371 transition count 318
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 654 place count 233 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 658 place count 231 transition count 191
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 660 place count 231 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 662 place count 229 transition count 189
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 667 place count 229 transition count 189
Applied a total of 667 rules in 154 ms. Remains 229 /578 variables (removed 349) and now considering 189/511 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 229/578 places, 189/511 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:03:06] [INFO ] Flow matrix only has 188 transitions (discarded 1 similar events)
// Phase 1: matrix 188 rows 229 cols
[2023-03-11 03:03:06] [INFO ] Computed 87 place invariants in 8 ms
[2023-03-11 03:03:06] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:03:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-11 03:03:06] [INFO ] [Nat]Absence check using 65 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-11 03:03:06] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:03:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 03:03:06] [INFO ] After 29ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:03:06] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 03:03:06] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 189/189 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 187
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 227 transition count 168
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 48 place count 202 transition count 168
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 196 transition count 162
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 196 transition count 162
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 185 transition count 151
Applied a total of 82 rules in 30 ms. Remains 185 /229 variables (removed 44) and now considering 151/189 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 185/229 places, 151/189 transitions.
Incomplete random walk after 10000 steps, including 460 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:03:06] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 185 cols
[2023-03-11 03:03:06] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-11 03:03:07] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:03:07] [INFO ] [Nat]Absence check using 64 positive place invariants in 7 ms returned sat
[2023-03-11 03:03:07] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-11 03:03:07] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 03:03:07] [INFO ] After 18ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:07] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:03:07] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 151/151 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 150
Applied a total of 2 rules in 10 ms. Remains 184 /185 variables (removed 1) and now considering 150/151 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 184/185 places, 150/151 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 598312 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598312 steps, saw 219667 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:03:10] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2023-03-11 03:03:10] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-11 03:03:10] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:03:10] [INFO ] [Nat]Absence check using 63 positive place invariants in 6 ms returned sat
[2023-03-11 03:03:10] [INFO ] [Nat]Absence check using 63 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-11 03:03:10] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 03:03:10] [INFO ] After 20ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:10] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:03:10] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 150/150 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 184/184 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-11 03:03:10] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
[2023-03-11 03:03:10] [INFO ] Invariant cache hit.
[2023-03-11 03:03:10] [INFO ] Implicit Places using invariants in 92 ms returned [10, 12, 14, 16, 18, 20, 22, 24, 26, 27, 28, 29, 30, 31, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 35 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 106 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/184 places, 147/150 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 143 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 143 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 142 transition count 128
Applied a total of 14 rules in 10 ms. Remains 142 /149 variables (removed 7) and now considering 128/147 (removed 19) transitions.
[2023-03-11 03:03:10] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
// Phase 1: matrix 127 rows 142 cols
[2023-03-11 03:03:10] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-11 03:03:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:03:10] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
[2023-03-11 03:03:10] [INFO ] Invariant cache hit.
[2023-03-11 03:03:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 03:03:10] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [5, 29, 30, 32, 40, 76, 78, 80, 82, 84, 86, 88]
Discarding 12 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 216 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 130/184 places, 121/150 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 130 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 126 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 121 transition count 102
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 121 transition count 102
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 121 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 120 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 22 place count 118 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 118 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 118 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 27 place count 117 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 31 place count 115 transition count 95
Applied a total of 31 rules in 11 ms. Remains 115 /130 variables (removed 15) and now considering 95/121 (removed 26) transitions.
[2023-03-11 03:03:10] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
// Phase 1: matrix 94 rows 115 cols
[2023-03-11 03:03:10] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-11 03:03:11] [INFO ] Implicit Places using invariants in 57 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 112/184 places, 95/150 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 92
Applied a total of 6 rules in 6 ms. Remains 109 /112 variables (removed 3) and now considering 92/95 (removed 3) transitions.
[2023-03-11 03:03:11] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
// Phase 1: matrix 91 rows 109 cols
[2023-03-11 03:03:11] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 03:03:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 03:03:11] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2023-03-11 03:03:11] [INFO ] Invariant cache hit.
[2023-03-11 03:03:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 03:03:11] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [24, 25, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 183 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 106/184 places, 92/150 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 90
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 91 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 88 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 88 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 88 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 35 place count 87 transition count 76
Applied a total of 35 rules in 10 ms. Remains 87 /106 variables (removed 19) and now considering 76/92 (removed 16) transitions.
[2023-03-11 03:03:11] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 87 cols
[2023-03-11 03:03:11] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-11 03:03:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 03:03:11] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-11 03:03:11] [INFO ] Invariant cache hit.
[2023-03-11 03:03:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 03:03:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 87/184 places, 76/150 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 732 ms. Remains : 87/184 places, 76/150 transitions.
Incomplete random walk after 10000 steps, including 617 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 170 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 182 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 962836 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 962836 steps, saw 330738 distinct states, run finished after 3002 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:03:14] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-11 03:03:14] [INFO ] Invariant cache hit.
[2023-03-11 03:03:14] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:03:14] [INFO ] [Nat]Absence check using 24 positive place invariants in 2 ms returned sat
[2023-03-11 03:03:14] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-11 03:03:14] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 03:03:14] [INFO ] After 8ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:14] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:03:14] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-11 03:03:14] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-11 03:03:14] [INFO ] Invariant cache hit.
[2023-03-11 03:03:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:03:14] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-11 03:03:14] [INFO ] Invariant cache hit.
[2023-03-11 03:03:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 03:03:14] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 03:03:14] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 03:03:14] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2023-03-11 03:03:14] [INFO ] Invariant cache hit.
[2023-03-11 03:03:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 87/87 places, 76/76 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 87 transition count 69
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 82 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 82 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 79 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 20 place count 78 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 22 place count 77 transition count 76
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 77 transition count 70
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 77 transition count 70
Applied a total of 30 rules in 13 ms. Remains 77 /87 variables (removed 10) and now considering 70/76 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 70 rows 77 cols
[2023-03-11 03:03:14] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 03:03:14] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:03:14] [INFO ] [Nat]Absence check using 24 positive place invariants in 2 ms returned sat
[2023-03-11 03:03:14] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 03:03:14] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:03:14] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:03:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-11 03:03:15] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-11 03:03:15] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2023-03-11 03:03:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2023-03-11 03:03:15] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 03:03:15] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 22 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 21 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 84 out of 578 places (down from 85) after GAL structural reductions.
Computed a total of 505 stabilizing places and 448 stable transitions
Graph (complete) has 1265 edges and 578 vertex of which 575 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.31 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 286 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 568 transition count 422
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 490 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 489 transition count 421
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 160 place count 489 transition count 311
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 401 place count 358 transition count 311
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 428 place count 331 transition count 284
Iterating global reduction 3 with 27 rules applied. Total rules applied 455 place count 331 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 455 place count 331 transition count 282
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 459 place count 329 transition count 282
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 726 place count 194 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 728 place count 193 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 192 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 191 transition count 148
Applied a total of 730 rules in 94 ms. Remains 191 /578 variables (removed 387) and now considering 148/511 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 191/578 places, 148/511 transitions.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 8 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 22 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 554 transition count 487
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 554 transition count 487
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 548 transition count 481
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 548 transition count 481
Applied a total of 60 rules in 30 ms. Remains 548 /578 variables (removed 30) and now considering 481/511 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 548/578 places, 481/511 transitions.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 33 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 18 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 46 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 31 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 30 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 541 transition count 474
Applied a total of 74 rules in 23 ms. Remains 541 /578 variables (removed 37) and now considering 474/511 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 541/578 places, 474/511 transitions.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 28 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 27 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 21 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 12 ms
[2023-03-11 03:03:15] [INFO ] Flatten gal took : 12 ms
[2023-03-11 03:03:15] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 51 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 24 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 21 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 32 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 13 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 289 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 487 transition count 419
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 164 place count 487 transition count 308
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 243 rules applied. Total rules applied 407 place count 355 transition count 308
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 436 place count 326 transition count 279
Iterating global reduction 2 with 29 rules applied. Total rules applied 465 place count 326 transition count 279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 465 place count 326 transition count 277
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 469 place count 324 transition count 277
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 737 place count 188 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 739 place count 187 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 186 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 185 transition count 143
Applied a total of 741 rules in 74 ms. Remains 185 /578 variables (removed 393) and now considering 143/511 (removed 368) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 185/578 places, 143/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 6 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 5 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 143 transitions.
Finished random walk after 134 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
FORMULA BusinessProcesses-PT-20-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 547 transition count 480
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 547 transition count 480
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 538 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 538 transition count 471
Applied a total of 80 rules in 31 ms. Remains 538 /578 variables (removed 40) and now considering 471/511 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 538/578 places, 471/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 24 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 26 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 548 transition count 481
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 548 transition count 481
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 539 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 539 transition count 472
Applied a total of 78 rules in 36 ms. Remains 539 /578 variables (removed 39) and now considering 472/511 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 539/578 places, 472/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 11 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 12 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 287 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 568 transition count 421
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 489 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 488 transition count 420
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 162 place count 488 transition count 307
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 410 place count 353 transition count 307
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 437 place count 326 transition count 280
Iterating global reduction 3 with 27 rules applied. Total rules applied 464 place count 326 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 464 place count 326 transition count 279
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 466 place count 325 transition count 279
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 726 place count 193 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 728 place count 192 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 191 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 190 transition count 149
Applied a total of 730 rules in 34 ms. Remains 190 /578 variables (removed 388) and now considering 149/511 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 190/578 places, 149/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 6 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 6 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Graph (trivial) has 291 edges and 578 vertex of which 7 / 578 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1258 edges and 572 vertex of which 569 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 568 transition count 419
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 487 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 486 transition count 418
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 166 place count 486 transition count 305
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 414 place count 351 transition count 305
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 443 place count 322 transition count 276
Iterating global reduction 3 with 29 rules applied. Total rules applied 472 place count 322 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 472 place count 322 transition count 274
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 476 place count 320 transition count 274
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 742 place count 185 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 744 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 745 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 182 transition count 141
Applied a total of 746 rules in 77 ms. Remains 182 /578 variables (removed 396) and now considering 141/511 (removed 370) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 182/578 places, 141/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 6 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 19 ms
[2023-03-11 03:03:16] [INFO ] Input system was already deterministic with 141 transitions.
Finished random walk after 1760 steps, including 228 resets, run visited all 1 properties in 9 ms. (steps per millisecond=195 )
FORMULA BusinessProcesses-PT-20-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 551 transition count 484
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 551 transition count 484
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 542 transition count 475
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 542 transition count 475
Applied a total of 72 rules in 36 ms. Remains 542 /578 variables (removed 36) and now considering 475/511 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 542/578 places, 475/511 transitions.
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 11 ms
[2023-03-11 03:03:16] [INFO ] Flatten gal took : 12 ms
[2023-03-11 03:03:17] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 511/511 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 549 transition count 482
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 549 transition count 482
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 540 transition count 473
Applied a total of 76 rules in 46 ms. Remains 540 /578 variables (removed 38) and now considering 473/511 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 540/578 places, 473/511 transitions.
[2023-03-11 03:03:17] [INFO ] Flatten gal took : 23 ms
[2023-03-11 03:03:17] [INFO ] Flatten gal took : 24 ms
[2023-03-11 03:03:17] [INFO ] Input system was already deterministic with 473 transitions.
[2023-03-11 03:03:17] [INFO ] Flatten gal took : 25 ms
[2023-03-11 03:03:17] [INFO ] Flatten gal took : 19 ms
[2023-03-11 03:03:17] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 03:03:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 578 places, 511 transitions and 1591 arcs took 3 ms.
Total runtime 40506 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
CTLFireability

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

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

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

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

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

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

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

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

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

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

BK_STOP 1678503913071

--------------------
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/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
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: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:314
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:340
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:299
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:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
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:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
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: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:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:299
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:544
lola: RELEASE
lola: RELEASE
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: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:253
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: 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 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: LAUNCH task # 16 (type EXCL) for 15 BusinessProcesses-PT-20-CTLFireability-05
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-05
lola: result : false
lola: markings : 283
lola: fired transitions : 566
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
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: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-20-CTLFireability-02
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-02
lola: result : false
lola: markings : 287
lola: fired transitions : 288
lola: time used : 0.000000
lola: memory pages used : 1
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:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: LAUNCH task # 28 (type EXCL) for 27 BusinessProcesses-PT-20-CTLFireability-11
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 28 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-11
lola: result : false
lola: markings : 91
lola: fired transitions : 126
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: LAUNCH task # 34 (type EXCL) for 33 BusinessProcesses-PT-20-CTLFireability-15
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: FINISHED task # 34 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-15
lola: result : false
lola: markings : 184
lola: fired transitions : 184
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
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:809
lola: LAUNCH task # 31 (type EXCL) for 30 BusinessProcesses-PT-20-CTLFireability-13
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
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:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:714
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 4/449 3/32 BusinessProcesses-PT-20-CTLFireability-13 369964 m, 73992 m/sec, 1637852 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 9/449 5/32 BusinessProcesses-PT-20-CTLFireability-13 690685 m, 64144 m/sec, 3392335 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 14/449 7/32 BusinessProcesses-PT-20-CTLFireability-13 1050050 m, 71873 m/sec, 5141024 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 19/449 10/32 BusinessProcesses-PT-20-CTLFireability-13 1486537 m, 87297 m/sec, 7014220 t fired, .

Time elapsed: 20 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 24/449 12/32 BusinessProcesses-PT-20-CTLFireability-13 1795768 m, 61846 m/sec, 8811319 t fired, .

Time elapsed: 25 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 29/449 14/32 BusinessProcesses-PT-20-CTLFireability-13 2184387 m, 77723 m/sec, 10631092 t fired, .

Time elapsed: 30 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 34/449 16/32 BusinessProcesses-PT-20-CTLFireability-13 2461744 m, 55471 m/sec, 12214286 t fired, .

Time elapsed: 35 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 39/449 18/32 BusinessProcesses-PT-20-CTLFireability-13 2737449 m, 55141 m/sec, 13840554 t fired, .

Time elapsed: 40 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 44/449 20/32 BusinessProcesses-PT-20-CTLFireability-13 3009989 m, 54508 m/sec, 15455271 t fired, .

Time elapsed: 45 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 49/449 21/32 BusinessProcesses-PT-20-CTLFireability-13 3298479 m, 57698 m/sec, 17025033 t fired, .

Time elapsed: 50 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 54/449 23/32 BusinessProcesses-PT-20-CTLFireability-13 3555736 m, 51451 m/sec, 18698079 t fired, .

Time elapsed: 55 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 59/449 24/32 BusinessProcesses-PT-20-CTLFireability-13 3802722 m, 49397 m/sec, 20324156 t fired, .

Time elapsed: 60 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 64/449 26/32 BusinessProcesses-PT-20-CTLFireability-13 4102919 m, 60039 m/sec, 21953041 t fired, .

Time elapsed: 65 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 69/449 28/32 BusinessProcesses-PT-20-CTLFireability-13 4400158 m, 59447 m/sec, 23569433 t fired, .

Time elapsed: 70 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 74/449 30/32 BusinessProcesses-PT-20-CTLFireability-13 4722410 m, 64450 m/sec, 25316408 t fired, .

Time elapsed: 75 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
31 CTL EXCL 79/449 32/32 BusinessProcesses-PT-20-CTLFireability-13 5082615 m, 72041 m/sec, 27143658 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
lola: CANCELED task # 31 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-09: EXEF 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-10: CTL 0 1 0 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

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

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
lola: LAUNCH task # 25 (type EXCL) for 24 BusinessProcesses-PT-20-CTLFireability-10
lola: time limit : 502 sec
lola: memory limit: 32 pages
lola: FINISHED task # 25 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-10
lola: result : false
lola: markings : 438
lola: fired transitions : 1326
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 21 BusinessProcesses-PT-20-CTLFireability-09
lola: time limit : 585 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-09
lola: result : true
lola: markings : 131
lola: fired transitions : 130
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 18 BusinessProcesses-PT-20-CTLFireability-06
lola: time limit : 702 sec
lola: memory limit: 32 pages
lola: FINISHED task # 19 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-06
lola: result : false
lola: markings : 232
lola: fired transitions : 232
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 BusinessProcesses-PT-20-CTLFireability-04
lola: time limit : 878 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-04
lola: result : false
lola: markings : 501
lola: fired transitions : 1077
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 BusinessProcesses-PT-20-CTLFireability-03
lola: time limit : 1171 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-03
lola: result : false
lola: markings : 283
lola: fired transitions : 283
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-20-CTLFireability-01
lola: time limit : 1757 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-01
lola: result : true
lola: markings : 132
lola: fired transitions : 132
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-20-CTLFireability-00
lola: time limit : 3514 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 4/3514 8/32 BusinessProcesses-PT-20-CTLFireability-00 1881200 m, 376240 m/sec, 4737641 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 9/3514 15/32 BusinessProcesses-PT-20-CTLFireability-00 3645151 m, 352790 m/sec, 9272306 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 14/3514 21/32 BusinessProcesses-PT-20-CTLFireability-00 5006076 m, 272185 m/sec, 13519715 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 19/3514 25/32 BusinessProcesses-PT-20-CTLFireability-00 6144015 m, 227587 m/sec, 17582046 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 24/3514 30/32 BusinessProcesses-PT-20-CTLFireability-00 7301507 m, 231498 m/sec, 21715802 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-20-CTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-20-CTLFireability-00: CTL 0 0 0 0 1 0 1 0
BusinessProcesses-PT-20-CTLFireability-13: CTL 0 0 0 0 1 0 1 0

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

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 12
lola: Portfolio finished: no open tasks 12

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-CTLFireability-00: CTL unknown AGGR
BusinessProcesses-PT-20-CTLFireability-01: CTL true CTL model checker
BusinessProcesses-PT-20-CTLFireability-02: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-03: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-04: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-05: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-06: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-09: EXEF true state space /EXEF
BusinessProcesses-PT-20-CTLFireability-10: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-11: CTL false CTL model checker
BusinessProcesses-PT-20-CTLFireability-13: CTL unknown AGGR
BusinessProcesses-PT-20-CTLFireability-15: CTL false CTL model checker


Time elapsed: 115 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-20"
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-20, 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-167813692800602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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