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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716305375274

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:29:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:29:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:29:36] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-21 15:29:36] [INFO ] Transformed 567 places.
[2024-05-21 15:29:36] [INFO ] Transformed 508 transitions.
[2024-05-21 15:29:36] [INFO ] Found NUPN structural information;
[2024-05-21 15:29:36] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 7 transitions.
Support contains 129 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 499 transition count 444
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 499 transition count 444
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 143 place count 474 transition count 419
Iterating global reduction 1 with 25 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 124 ms. Remains 474 /560 variables (removed 86) and now considering 419/501 (removed 82) transitions.
// Phase 1: matrix 419 rows 474 cols
[2024-05-21 15:29:37] [INFO ] Computed 91 invariants in 49 ms
[2024-05-21 15:29:37] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 15:29:37] [INFO ] Invariant cache hit.
[2024-05-21 15:29:38] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-21 15:29:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 27 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:46] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 2 ms to minimize.
[2024-05-21 15:29:47] [INFO ] Deduced a trap composed of 70 places in 553 ms of which 4 ms to minimize.
[2024-05-21 15:29:47] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:29:47] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:29:47] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 5 ms to minimize.
[2024-05-21 15:29:48] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:29:49] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 4 ms to minimize.
[2024-05-21 15:29:49] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 2 ms to minimize.
[2024-05-21 15:29:49] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:29:49] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 2 ms to minimize.
[2024-05-21 15:29:49] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 5 ms to minimize.
[2024-05-21 15:29:50] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 15:29:51] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 19 ms to minimize.
[2024-05-21 15:29:52] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:29:52] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:29:52] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:29:52] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:29:52] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 1 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:29:53] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 15 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:29:54] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 9 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:29:55] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:29:58] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:29:59] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:30:00] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:30:01] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:30:02] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:30:03] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 4 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:30:04] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:30:05] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:30:06] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:30:07] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:30:08] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30272ms
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 419/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31358 ms. Remains : 474/560 places, 419/501 transitions.
Support contains 129 out of 474 places after structural reductions.
[2024-05-21 15:30:08] [INFO ] Flatten gal took : 77 ms
[2024-05-21 15:30:08] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:30:08] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (297 resets) in 2094 ms. (19 steps per ms) remains 38/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
[2024-05-21 15:30:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 243/319 variables, 37/37 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 42/361 variables, 12/49 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 36 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/465 variables, 42/91 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 413/878 variables, 465/556 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 0/556 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/891 variables, 7/563 constraints. Problems are: Problem set: 9 solved, 29 unsolved
[2024-05-21 15:30:12] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:30:12] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:30:12] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:30:12] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:30:12] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 37 places in 733 ms of which 1 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:30:13] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:30:14] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:30:15] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 5053ms, After SMT, problems are : Problem set: 9 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 473 transition count 373
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 428 transition count 368
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 423 transition count 368
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 101 place count 423 transition count 290
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 271 place count 331 transition count 290
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 285 place count 317 transition count 276
Iterating global reduction 3 with 14 rules applied. Total rules applied 299 place count 317 transition count 276
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 484 place count 223 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 223 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 223 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 487 place count 222 transition count 183
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 495 place count 222 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 496 place count 221 transition count 182
Applied a total of 496 rules in 107 ms. Remains 221 /474 variables (removed 253) and now considering 182/419 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 221/474 places, 182/419 transitions.
RANDOM walk for 40000 steps (1660 resets) in 962 ms. (41 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (28 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (26 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (26 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (29 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (29 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (27 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 804242 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :26 out of 29
Probabilistic random walk after 804242 steps, saw 126427 distinct states, run finished after 3006 ms. (steps per millisecond=267 ) properties seen :26
// Phase 1: matrix 182 rows 221 cols
[2024-05-21 15:30:18] [INFO ] Computed 74 invariants in 19 ms
[2024-05-21 15:30:18] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/115 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/178 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/184 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/186 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 176/362 variables, 186/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 38/400 variables, 33/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/402 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/403 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/403 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/403 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 296 constraints, problems are : Problem set: 0 solved, 3 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:30:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 33/115 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 6 (OVERLAPS) 63/178 variables, 24/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/184 variables, 6/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/186 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 176/362 variables, 186/248 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 1/249 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 15:30:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 1/250 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 38/400 variables, 33/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/400 variables, 12/295 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 1/296 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 0/296 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/402 variables, 1/297 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/403 variables, 2/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/403 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 299 constraints, problems are : Problem set: 2 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 884ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 182/182 transitions.
Graph (trivial) has 47 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 220 transition count 172
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 212 transition count 172
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 17 place count 212 transition count 154
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 56 place count 191 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 184 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 184 transition count 147
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 166 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 108 place count 165 transition count 146
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 165 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 162 transition count 143
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 115 place count 162 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 161 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 161 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 159 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 157 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 157 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 156 transition count 139
Applied a total of 123 rules in 58 ms. Remains 156 /221 variables (removed 65) and now considering 139/182 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 156/221 places, 139/182 transitions.
RANDOM walk for 40000 steps (2135 resets) in 539 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 317 steps (1 resets) in 4 ms. (63 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-05-21 15:30:19] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:30:19] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:30:19] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 100 out of 474 places (down from 105) after GAL structural reductions.
Computed a total of 459 stabilizing places and 404 stable transitions
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 472 transition count 362
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 417 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 415 transition count 360
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 115 place count 415 transition count 270
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 312 place count 308 transition count 270
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 334 place count 286 transition count 248
Iterating global reduction 3 with 22 rules applied. Total rules applied 356 place count 286 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 356 place count 286 transition count 247
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 358 place count 285 transition count 247
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 551 place count 187 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 557 place count 187 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 186 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 185 transition count 151
Applied a total of 559 rules in 91 ms. Remains 185 /474 variables (removed 289) and now considering 151/419 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 185/474 places, 151/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 38 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 440/474 places, 385/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 29 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 227 edges and 474 vertex of which 6 / 474 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 1039 edges and 469 vertex of which 468 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 467 transition count 349
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 405 transition count 349
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 126 place count 405 transition count 256
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 354 place count 270 transition count 232
Iterating global reduction 2 with 24 rules applied. Total rules applied 378 place count 270 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 270 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 382 place count 268 transition count 230
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 567 place count 174 transition count 139
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 573 place count 174 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 574 place count 173 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 172 transition count 138
Applied a total of 575 rules in 41 ms. Remains 172 /474 variables (removed 302) and now considering 138/419 (removed 281) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 172/474 places, 138/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 18 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 440/474 places, 385/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 439 transition count 384
Applied a total of 70 rules in 18 ms. Remains 439 /474 variables (removed 35) and now considering 384/419 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 439/474 places, 384/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 19 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 438/474 places, 383/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 31 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 440/474 places, 385/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 21 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 441/474 places, 386/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 224 edges and 474 vertex of which 6 / 474 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 1039 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 467 transition count 351
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 352 place count 272 transition count 234
Iterating global reduction 3 with 22 rules applied. Total rules applied 374 place count 272 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 374 place count 272 transition count 233
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 376 place count 271 transition count 233
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 583 place count 166 transition count 131
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 589 place count 166 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 590 place count 165 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 164 transition count 130
Applied a total of 591 rules in 78 ms. Remains 164 /474 variables (removed 310) and now considering 130/419 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 164/474 places, 130/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:30:20] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 19 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 441/474 places, 386/419 transitions.
[2024-05-21 15:30:20] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 35 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 440/474 places, 385/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 35 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 438/474 places, 383/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 19 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 441/474 places, 386/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 472 transition count 360
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 415 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 413 transition count 358
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 119 place count 413 transition count 260
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 333 place count 297 transition count 260
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 356 place count 274 transition count 237
Iterating global reduction 3 with 23 rules applied. Total rules applied 379 place count 274 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 379 place count 274 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 383 place count 272 transition count 235
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 584 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 590 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 168 transition count 135
Applied a total of 592 rules in 75 ms. Remains 168 /474 variables (removed 306) and now considering 135/419 (removed 284) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 168/474 places, 135/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 19 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 438/474 places, 383/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 18 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 438/474 places, 383/419 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:30:21] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:30:21] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:30:21] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 15:30:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 419 transitions and 1330 arcs took 3 ms.
Total runtime 44949 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-11

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/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: 1003
MODEL NAME: /home/mcc/execution/415/model
474 places, 419 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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-11-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-11-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-11-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

Error in allocating array of size 2097152 at unique_table.cc, line 313
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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="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-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;