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.r472-tajo-171620399800586.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 ltsminxred
Input is BusinessProcesses-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800586
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 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 177K 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-18-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717226061955

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:23] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:14:23] [INFO ] Transformed 717 places.
[2024-06-01 07:14:23] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:23] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:23] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Support contains 98 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 96 place count 606 transition count 539
Iterating global reduction 1 with 88 rules applied. Total rules applied 184 place count 606 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 185 place count 606 transition count 538
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 222 place count 569 transition count 501
Iterating global reduction 2 with 37 rules applied. Total rules applied 259 place count 569 transition count 501
Applied a total of 259 rules in 149 ms. Remains 569 /702 variables (removed 133) and now considering 501/627 (removed 126) transitions.
// Phase 1: matrix 501 rows 569 cols
[2024-06-01 07:14:23] [INFO ] Computed 106 invariants in 59 ms
[2024-06-01 07:14:24] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 07:14:24] [INFO ] Invariant cache hit.
[2024-06-01 07:14:24] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-01 07:14:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 95 places in 200 ms of which 31 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 4 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 108 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 7 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 6 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 140 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 4 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 4 ms to minimize.
SMT process timed out in 30341ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 30382ms
Starting structural reductions in LTL mode, iteration 1 : 569/702 places, 501/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31569 ms. Remains : 569/702 places, 501/627 transitions.
Support contains 98 out of 569 places after structural reductions.
[2024-06-01 07:14:55] [INFO ] Flatten gal took : 66 ms
[2024-06-01 07:14:55] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:14:55] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 89 out of 569 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (209 resets) in 2153 ms. (18 steps per ms) remains 22/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
[2024-06-01 07:14:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 319/359 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 16/60 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 3 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/80 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 107 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 107 places in 77 ms of which 2 ms to minimize.
SMT process timed out in 5079ms, After SMT, problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (complete) has 1251 edges and 569 vertex of which 568 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 568 transition count 439
Reduce places removed 61 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 507 transition count 436
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 504 transition count 436
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 129 place count 504 transition count 328
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 365 place count 376 transition count 328
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 376 place count 365 transition count 317
Iterating global reduction 3 with 11 rules applied. Total rules applied 387 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 388 place count 364 transition count 316
Iterating global reduction 3 with 1 rules applied. Total rules applied 389 place count 364 transition count 316
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 662 place count 227 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 663 place count 227 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 665 place count 226 transition count 182
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 671 place count 226 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 672 place count 225 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 673 place count 224 transition count 181
Applied a total of 673 rules in 123 ms. Remains 224 /569 variables (removed 345) and now considering 181/501 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 224/569 places, 181/501 transitions.
RANDOM walk for 40000 steps (2304 resets) in 1495 ms. (26 steps per ms) remains 12/20 properties
BEST_FIRST walk for 40004 steps (563 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (561 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (570 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (514 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (547 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (558 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (575 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (585 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (565 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (579 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (563 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (564 resets) in 96 ms. (412 steps per ms) remains 6/12 properties
// Phase 1: matrix 181 rows 224 cols
[2024-06-01 07:15:02] [INFO ] Computed 84 invariants in 5 ms
[2024-06-01 07:15:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/92 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/115 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 42/157 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem AtomicPropp44 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 8/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/159 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 180/339 variables, 159/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 4/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 66/405 variables, 65/291 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 30/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/405 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 321 constraints, problems are : Problem set: 1 solved, 5 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 224/224 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 23/114 variables, 20/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 43/157 variables, 18/52 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 8/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/159 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 180/339 variables, 159/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 4/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 3/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 66/405 variables, 65/296 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/405 variables, 30/326 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/405 variables, 2/328 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem AtomicPropp17 is UNSAT
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/405 variables, 5/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/405 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/405 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 333 constraints, problems are : Problem set: 2 solved, 4 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 224/224 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 16/16 constraints]
After SMT, in 1880ms problems are : Problem set: 2 solved, 4 unsolved
Finished Parikh walk after 5031 steps, including 66 resets, run visited all 4 properties in 23 ms. (steps per millisecond=218 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 28 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:15:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 30 ms
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:15:04] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 64 out of 569 places (down from 78) after GAL structural reductions.
Computed a total of 512 stabilizing places and 454 stable transitions
Graph (complete) has 1251 edges and 569 vertex of which 568 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 45 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:15:04] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 538 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 537 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 45 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 536/569 places, 468/501 transitions.
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:15:04] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 49 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 532/569 places, 464/501 transitions.
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:04] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:04] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 283 edges and 569 vertex of which 6 / 569 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 1245 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 562 transition count 419
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 488 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 152 place count 487 transition count 305
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 402 place count 350 transition count 305
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 424 place count 328 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 447 place count 327 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 448 place count 326 transition count 282
Iterating global reduction 3 with 1 rules applied. Total rules applied 449 place count 326 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 731 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 183 transition count 141
Applied a total of 732 rules in 70 ms. Remains 183 /569 variables (removed 386) and now considering 141/501 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 183/569 places, 141/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 50 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 547 transition count 479
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 547 transition count 479
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 538 transition count 470
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 538 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 537 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 48 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 536/569 places, 468/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 27 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 535/569 places, 467/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 467 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (complete) has 1251 edges and 569 vertex of which 568 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 567 transition count 433
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 501 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 499 transition count 431
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 137 place count 499 transition count 306
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 412 place count 349 transition count 306
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 433 place count 328 transition count 285
Ensure Unique test removed 1 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 455 place count 327 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 456 place count 326 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 457 place count 326 transition count 284
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 731 place count 188 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 188 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 733 place count 187 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 186 transition count 146
Applied a total of 734 rules in 56 ms. Remains 186 /569 variables (removed 383) and now considering 146/501 (removed 355) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 186/569 places, 146/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1245 edges and 564 vertex of which 563 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 562 transition count 418
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 152 place count 487 transition count 302
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 408 place count 347 transition count 302
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 431 place count 324 transition count 279
Ensure Unique test removed 1 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 455 place count 323 transition count 279
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 456 place count 322 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 457 place count 322 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 739 place count 180 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 740 place count 179 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Applied a total of 741 rules in 40 ms. Remains 178 /569 variables (removed 391) and now considering 137/501 (removed 364) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 178/569 places, 137/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (5292 resets) in 608 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 128 steps, run visited all 1 properties in 7 ms. (steps per millisecond=18 )
Probabilistic random walk after 128 steps, saw 76 distinct states, run finished after 10 ms. (steps per millisecond=12 ) properties seen :1
FORMULA BusinessProcesses-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 280 edges and 569 vertex of which 6 / 569 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 1245 edges and 564 vertex of which 563 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 562 transition count 421
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 490 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 489 transition count 420
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 148 place count 489 transition count 304
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 404 place count 349 transition count 304
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 426 place count 327 transition count 282
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 449 place count 326 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 450 place count 325 transition count 281
Iterating global reduction 3 with 1 rules applied. Total rules applied 451 place count 325 transition count 281
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 728 place count 186 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 729 place count 185 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 184 transition count 142
Applied a total of 730 rules in 47 ms. Remains 184 /569 variables (removed 385) and now considering 142/501 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 184/569 places, 142/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 543 transition count 475
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 543 transition count 475
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 533 transition count 465
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 39 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:05] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:05] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 535 transition count 467
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Applied a total of 72 rules in 45 ms. Remains 533 /569 variables (removed 36) and now considering 465/501 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 533/569 places, 465/501 transitions.
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:06] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 286 edges and 569 vertex of which 6 / 569 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 1245 edges and 564 vertex of which 563 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 562 transition count 418
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 487 transition count 418
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 152 place count 487 transition count 303
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 406 place count 348 transition count 303
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 429 place count 325 transition count 280
Ensure Unique test removed 1 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 453 place count 324 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 454 place count 323 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 455 place count 323 transition count 279
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 737 place count 181 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 180 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 739 place count 179 transition count 138
Applied a total of 739 rules in 40 ms. Remains 179 /569 variables (removed 390) and now considering 138/501 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 179/569 places, 138/501 transitions.
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:06] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 42 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 532/569 places, 464/501 transitions.
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:06] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 538 transition count 470
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 28 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 538/569 places, 470/501 transitions.
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:06] [INFO ] Input system was already deterministic with 470 transitions.
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:06] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:15:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 501 transitions and 1570 arcs took 3 ms.
Total runtime 43227 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-18-CTLFireability-2023-15

BK_STOP 1717226106683

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1023/ctl_0_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1023/ctl_1_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1023/ctl_2_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1023/ctl_3_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1023/ctl_4_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1023/ctl_5_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1023/ctl_6_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1023/ctl_7_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1023/ctl_8_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1023/ctl_9_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1023/ctl_10_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1023/ctl_11_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1023/ctl_12_
ctl formula name BusinessProcesses-PT-18-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1023/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-18"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-18, 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 r472-tajo-171620399800586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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