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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 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 85K 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-06-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716303668371

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:01:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:01:10] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 15:01:10] [INFO ] Transformed 376 places.
[2024-05-21 15:01:10] [INFO ] Transformed 297 transitions.
[2024-05-21 15:01:10] [INFO ] Found NUPN structural information;
[2024-05-21 15:01:10] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 1 transitions.
Support contains 94 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 348 transition count 271
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 348 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 339 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 339 transition count 262
Applied a total of 70 rules in 123 ms. Remains 339 /375 variables (removed 36) and now considering 262/296 (removed 34) transitions.
// Phase 1: matrix 262 rows 339 cols
[2024-05-21 15:01:10] [INFO ] Computed 79 invariants in 24 ms
[2024-05-21 15:01:10] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 15:01:10] [INFO ] Invariant cache hit.
[2024-05-21 15:01:11] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-21 15:01:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 21 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:01:16] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 13 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 8 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-21 15:01:17] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 16 places in 529 ms of which 1 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-21 15:01:18] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:01:19] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:01:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 9 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:01:21] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:01:22] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 6 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:01:23] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:01:25] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:01:26] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:01:28] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:29] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:01:30] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:01:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-21 15:01:33] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-21 15:01:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:01:35] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:01:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:01:38] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:01:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 339/601 variables, and 187 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/339 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 108/187 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 15:01:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 262/601 variables, 339/528 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 261/789 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:01:48] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:01:49] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:01:50] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:01:51] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 18/807 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 15:02:01] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:02:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:02:02] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:02:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:02:05] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:02:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:02:08] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 8/815 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 815 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 136/136 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 339/375 places, 262/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61155 ms. Remains : 339/375 places, 262/296 transitions.
Support contains 94 out of 339 places after structural reductions.
[2024-05-21 15:02:11] [INFO ] Flatten gal took : 78 ms
[2024-05-21 15:02:11] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:02:11] [INFO ] Input system was already deterministic with 262 transitions.
RANDOM walk for 40000 steps (419 resets) in 2519 ms. (15 steps per ms) remains 10/69 properties
BEST_FIRST walk for 40004 steps (101 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (73 resets) in 213 ms. (186 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (73 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (92 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (73 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (70 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (73 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (57 resets) in 310 ms. (128 steps per ms) remains 7/8 properties
[2024-05-21 15:02:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 116/128 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 99/227 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 85/312 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 235/547 variables, 312/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 41/588 variables, 18/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 11/599 variables, 8/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/601 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/601 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 418 constraints, problems are : Problem set: 0 solved, 7 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/128 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 99/227 variables, 19/42 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 5/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 85/312 variables, 38/85 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 15:02:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/87 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 5/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 235/547 variables, 312/404 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 2/406 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:02:15] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 7/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 41/588 variables, 18/431 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 4/435 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 8/443 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/443 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 11/599 variables, 8/451 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/599 variables, 0/451 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 21 (OVERLAPS) 2/601 variables, 1/452 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:02:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 2/454 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 0/454 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/601 variables, 0/454 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 454 constraints, problems are : Problem set: 3 solved, 4 unsolved in 3161 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 30/30 constraints]
After SMT, in 3725ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 1439 ms.
Support contains 6 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 154 edges and 339 vertex of which 7 / 339 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 645 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 332 transition count 213
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 293 transition count 213
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 80 place count 293 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 219 place count 219 transition count 148
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 239 place count 199 transition count 128
Iterating global reduction 2 with 20 rules applied. Total rules applied 259 place count 199 transition count 128
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 421 place count 114 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 114 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 423 place count 113 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 112 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 111 transition count 49
Applied a total of 426 rules in 75 ms. Remains 111 /339 variables (removed 228) and now considering 49/262 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 111/339 places, 49/262 transitions.
RANDOM walk for 190 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/4 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:02:18] [INFO ] Input system was already deterministic with 262 transitions.
Computed a total of 331 stabilizing places and 252 stable transitions
Graph (complete) has 653 edges and 339 vertex of which 338 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 310 transition count 233
Applied a total of 58 rules in 41 ms. Remains 310 /339 variables (removed 29) and now considering 233/262 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 310/339 places, 233/262 transitions.
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:02:18] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 310 transition count 233
Applied a total of 58 rules in 39 ms. Remains 310 /339 variables (removed 29) and now considering 233/262 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 310/339 places, 233/262 transitions.
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:02:18] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 161 edges and 339 vertex of which 7 / 339 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 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 331 transition count 210
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 288 transition count 210
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 88 place count 288 transition count 145
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 228 place count 213 transition count 145
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 250 place count 191 transition count 123
Iterating global reduction 2 with 22 rules applied. Total rules applied 272 place count 191 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 430 place count 108 transition count 48
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 432 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 105 transition count 46
Applied a total of 434 rules in 58 ms. Remains 105 /339 variables (removed 234) and now considering 46/262 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 105/339 places, 46/262 transitions.
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:18] [INFO ] Input system was already deterministic with 46 transitions.
RANDOM walk for 292 steps (108 resets) in 5 ms. (48 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 157 edges and 339 vertex of which 7 / 339 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 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 289 transition count 211
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 86 place count 289 transition count 149
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 219 place count 218 transition count 149
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 239 place count 198 transition count 129
Iterating global reduction 2 with 20 rules applied. Total rules applied 259 place count 198 transition count 129
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 417 place count 115 transition count 54
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 419 place count 114 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 113 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 112 transition count 52
Applied a total of 421 rules in 31 ms. Remains 112 /339 variables (removed 227) and now considering 52/262 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 112/339 places, 52/262 transitions.
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:18] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 312 transition count 235
Applied a total of 54 rules in 33 ms. Remains 312 /339 variables (removed 27) and now considering 235/262 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 312/339 places, 235/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 311 transition count 234
Applied a total of 56 rules in 24 ms. Remains 311 /339 variables (removed 28) and now considering 234/262 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 311/339 places, 234/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 24 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (complete) has 653 edges and 339 vertex of which 338 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 337 transition count 225
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 302 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 300 transition count 223
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 75 place count 300 transition count 152
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 227 place count 219 transition count 152
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 250 place count 196 transition count 129
Iterating global reduction 3 with 23 rules applied. Total rules applied 273 place count 196 transition count 129
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 422 place count 121 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 120 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 424 place count 119 transition count 54
Applied a total of 424 rules in 60 ms. Remains 119 /339 variables (removed 220) and now considering 54/262 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 119/339 places, 54/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (complete) has 653 edges and 339 vertex of which 338 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (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 32 place count 337 transition count 229
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 306 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 303 transition count 226
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 69 place count 303 transition count 158
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 214 place count 226 transition count 158
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 234 place count 206 transition count 138
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 206 transition count 138
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 410 place count 124 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 123 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 122 transition count 63
Applied a total of 412 rules in 41 ms. Remains 122 /339 variables (removed 217) and now considering 63/262 (removed 199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 122/339 places, 63/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 10 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 316 transition count 239
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 316 transition count 239
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 309 transition count 232
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 309 transition count 232
Applied a total of 60 rules in 26 ms. Remains 309 /339 variables (removed 30) and now considering 232/262 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 309/339 places, 232/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 159 edges and 339 vertex of which 7 / 339 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 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 289 transition count 211
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 86 place count 289 transition count 146
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 226 place count 214 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 247 place count 193 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 268 place count 193 transition count 125
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 426 place count 110 transition count 50
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 428 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 108 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 107 transition count 48
Applied a total of 430 rules in 31 ms. Remains 107 /339 variables (removed 232) and now considering 48/262 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 107/339 places, 48/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 17 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 19 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 161 edges and 339 vertex of which 7 / 339 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 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 289 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 288 transition count 210
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 88 place count 288 transition count 145
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 227 place count 214 transition count 145
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 249 place count 192 transition count 123
Iterating global reduction 3 with 22 rules applied. Total rules applied 271 place count 192 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 429 place count 109 transition count 48
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 431 place count 108 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 432 place count 107 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 433 place count 106 transition count 46
Applied a total of 433 rules in 22 ms. Remains 106 /339 variables (removed 233) and now considering 46/262 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 106/339 places, 46/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 321 transition count 244
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 321 transition count 244
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 316 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 316 transition count 239
Applied a total of 46 rules in 12 ms. Remains 316 /339 variables (removed 23) and now considering 239/262 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 316/339 places, 239/262 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:02:19] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:02:19] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 15:02:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 339 places, 262 transitions and 758 arcs took 4 ms.
Total runtime 69860 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 339
TRANSITIONS: 262
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/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: 1080
MODEL NAME: /home/mcc/execution/416/model
339 places, 262 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-06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716305805282

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 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

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 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-06"
export BK_EXAMINATION="CTLFireability"
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-06, 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 r047-tajo-171620398300490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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