Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716302693654

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:44:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:44:56] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-21 14:44:56] [INFO ] Transformed 288 places.
[2024-05-21 14:44:56] [INFO ] Transformed 283 transitions.
[2024-05-21 14:44:56] [INFO ] Found NUPN structural information;
[2024-05-21 14:44:56] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 281
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 260 transition count 256
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 260 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 260 transition count 255
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 249 transition count 244
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 249 transition count 244
Applied a total of 74 rules in 94 ms. Remains 249 /286 variables (removed 37) and now considering 244/281 (removed 37) transitions.
// Phase 1: matrix 244 rows 249 cols
[2024-05-21 14:44:57] [INFO ] Computed 43 invariants in 19 ms
[2024-05-21 14:44:57] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-21 14:44:57] [INFO ] Invariant cache hit.
[2024-05-21 14:44:58] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-21 14:44:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 3/249 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 14:45:03] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 111 ms to minimize.
[2024-05-21 14:45:03] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 6 ms to minimize.
[2024-05-21 14:45:07] [INFO ] Deduced a trap composed of 32 places in 3253 ms of which 33 ms to minimize.
[2024-05-21 14:45:07] [INFO ] Deduced a trap composed of 55 places in 313 ms of which 2 ms to minimize.
[2024-05-21 14:45:07] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 2 ms to minimize.
[2024-05-21 14:45:07] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-21 14:45:10] [INFO ] Deduced a trap composed of 44 places in 2590 ms of which 20 ms to minimize.
[2024-05-21 14:45:10] [INFO ] Deduced a trap composed of 55 places in 181 ms of which 2 ms to minimize.
[2024-05-21 14:45:10] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2024-05-21 14:45:10] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 4 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-05-21 14:45:11] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2024-05-21 14:45:12] [INFO ] Deduced a trap composed of 60 places in 1017 ms of which 24 ms to minimize.
[2024-05-21 14:45:13] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-05-21 14:45:13] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-05-21 14:45:13] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 14:45:13] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 2 ms to minimize.
[2024-05-21 14:45:13] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 5 ms to minimize.
[2024-05-21 14:45:14] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-21 14:45:14] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:45:14] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 55 places in 2056 ms of which 2 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 3 ms to minimize.
[2024-05-21 14:45:16] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 3 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 11 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 14:45:17] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 3 ms to minimize.
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 3 ms to minimize.
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 3 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 20/83 constraints. Problems are: Problem set: 5 solved, 238 unsolved
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 3 ms to minimize.
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-05-21 14:45:18] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-21 14:45:19] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2024-05-21 14:45:19] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 2 ms to minimize.
[2024-05-21 14:45:19] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-05-21 14:45:19] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-05-21 14:45:19] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 5 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 5 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-21 14:45:20] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 14:45:21] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 9 ms to minimize.
[2024-05-21 14:45:21] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-21 14:45:21] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-21 14:45:21] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 20/103 constraints. Problems are: Problem set: 9 solved, 234 unsolved
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 14:45:23] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-21 14:45:24] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 6 ms to minimize.
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 20/123 constraints. Problems are: Problem set: 17 solved, 226 unsolved
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 14:45:25] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 3 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 3 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 14:45:26] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-21 14:45:27] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 20/143 constraints. Problems are: Problem set: 27 solved, 216 unsolved
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-21 14:45:28] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 14:45:29] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
SMT process timed out in 30275ms, After SMT, problems are : Problem set: 27 solved, 216 unsolved
Search for dead transitions found 27 dead transitions in 30309ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 249/286 places, 217/281 transitions.
Applied a total of 0 rules in 13 ms. Remains 249 /249 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32163 ms. Remains : 249/286 places, 217/281 transitions.
Support contains 87 out of 249 places after structural reductions.
[2024-05-21 14:45:29] [INFO ] Flatten gal took : 53 ms
[2024-05-21 14:45:29] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:45:29] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 71 out of 249 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (444 resets) in 1399 ms. (28 steps per ms) remains 1/53 properties
BEST_FIRST walk for 40003 steps (88 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
// Phase 1: matrix 217 rows 249 cols
[2024-05-21 14:45:30] [INFO ] Computed 43 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/168 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/244 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/246 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/461 variables, 246/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/466 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/466 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/168 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 14:45:30] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 14:45:30] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2024-05-21 14:45:31] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 1 ms to minimize.
[2024-05-21 14:45:31] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:45:31] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 26 ms to minimize.
[2024-05-21 14:45:31] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 244/466 variables, and 48 constraints, problems are : Problem set: 1 solved, 0 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/249 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1461ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 29 ms
[2024-05-21 14:45:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 23 ms
[2024-05-21 14:45:31] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 61 out of 249 places (down from 68) after GAL structural reductions.
Computed a total of 224 stabilizing places and 193 stable transitions
Graph (complete) has 541 edges and 249 vertex of which 246 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Graph (trivial) has 116 edges and 249 vertex of which 6 / 249 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 534 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 240 transition count 178
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 209 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 208 transition count 177
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 66 place count 208 transition count 132
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 161 place count 158 transition count 132
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 176 place count 143 transition count 117
Iterating global reduction 3 with 15 rules applied. Total rules applied 191 place count 143 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 191 place count 143 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 140 transition count 114
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 279 place count 99 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 98 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 281 place count 97 transition count 72
Applied a total of 281 rules in 69 ms. Remains 97 /249 variables (removed 152) and now considering 72/217 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 97/249 places, 72/217 transitions.
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:45:31] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Graph (trivial) has 117 edges and 249 vertex of which 6 / 249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 534 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 240 transition count 177
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 208 transition count 177
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 208 transition count 131
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 156 transition count 131
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 141 transition count 116
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 141 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 194 place count 141 transition count 112
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 137 transition count 112
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 278 place count 99 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 98 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 97 transition count 73
Applied a total of 280 rules in 54 ms. Remains 97 /249 variables (removed 152) and now considering 73/217 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 97/249 places, 73/217 transitions.
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:31] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 229 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 229 transition count 199
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 221 transition count 191
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 221 transition count 191
Applied a total of 54 rules in 15 ms. Remains 221 /249 variables (removed 28) and now considering 191/217 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 221/249 places, 191/217 transitions.
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 39 ms
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 14:45:31] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 227 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 227 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 220 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 220 transition count 190
Applied a total of 56 rules in 16 ms. Remains 220 /249 variables (removed 29) and now considering 190/217 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 220/249 places, 190/217 transitions.
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:45:31] [INFO ] Input system was already deterministic with 190 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Graph (trivial) has 118 edges and 249 vertex of which 6 / 249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 534 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 240 transition count 177
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 208 transition count 177
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 208 transition count 131
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 156 transition count 131
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 140 transition count 115
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 140 transition count 115
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 196 place count 140 transition count 111
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 204 place count 136 transition count 111
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 284 place count 96 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 285 place count 95 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 94 transition count 70
Applied a total of 286 rules in 29 ms. Remains 94 /249 variables (removed 155) and now considering 70/217 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 94/249 places, 70/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 70 transitions.
RANDOM walk for 1035 steps (127 resets) in 25 ms. (39 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 248 transition count 217
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 230 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 230 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 224 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 224 transition count 193
Applied a total of 49 rules in 18 ms. Remains 224 /249 variables (removed 25) and now considering 193/217 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 224/249 places, 193/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 227 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 227 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 219 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 219 transition count 189
Applied a total of 58 rules in 15 ms. Remains 219 /249 variables (removed 30) and now considering 189/217 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 219/249 places, 189/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 229 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 229 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 223 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 223 transition count 193
Applied a total of 50 rules in 16 ms. Remains 223 /249 variables (removed 26) and now considering 193/217 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 223/249 places, 193/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 48 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 229 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 229 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 223 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 223 transition count 193
Applied a total of 50 rules in 15 ms. Remains 223 /249 variables (removed 26) and now considering 193/217 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 223/249 places, 193/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Graph (trivial) has 114 edges and 249 vertex of which 6 / 249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 534 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 240 transition count 178
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 209 transition count 178
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 64 place count 209 transition count 135
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 154 place count 162 transition count 135
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 169 place count 147 transition count 120
Iterating global reduction 2 with 15 rules applied. Total rules applied 184 place count 147 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 184 place count 147 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 143 transition count 116
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 268 place count 105 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 104 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 103 transition count 77
Applied a total of 270 rules in 28 ms. Remains 103 /249 variables (removed 146) and now considering 77/217 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 103/249 places, 77/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Graph (trivial) has 117 edges and 249 vertex of which 6 / 249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 534 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 240 transition count 177
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 208 transition count 177
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 208 transition count 131
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 156 transition count 131
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 141 transition count 116
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 141 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 194 place count 141 transition count 112
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 137 transition count 112
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 282 place count 97 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 96 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 95 transition count 71
Applied a total of 284 rules in 25 ms. Remains 95 /249 variables (removed 154) and now considering 71/217 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 95/249 places, 71/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 71 transitions.
RANDOM walk for 701 steps (78 resets) in 6 ms. (100 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 227 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 227 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 219 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 219 transition count 189
Applied a total of 58 rules in 9 ms. Remains 219 /249 variables (removed 30) and now considering 189/217 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 219/249 places, 189/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 248 transition count 217
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 230 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 230 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 225 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 225 transition count 194
Applied a total of 47 rules in 9 ms. Remains 225 /249 variables (removed 24) and now considering 194/217 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 225/249 places, 194/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 247 transition count 217
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 227 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 227 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 219 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 219 transition count 189
Applied a total of 58 rules in 8 ms. Remains 219 /249 variables (removed 30) and now considering 189/217 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 219/249 places, 189/217 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:32] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:45:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:45:32] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 14:45:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 249 places, 217 transitions and 675 arcs took 2 ms.
Total runtime 36337 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 249
TRANSITIONS: 217
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.003s]


SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 926
MODEL NAME: /home/mcc/execution/422/model
249 places, 217 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716305148879

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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