Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225682454

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:08:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:08:04] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 07:08:04] [INFO ] Transformed 586 places.
[2024-06-01 07:08:04] [INFO ] Transformed 525 transitions.
[2024-06-01 07:08:04] [INFO ] Found NUPN structural information;
[2024-06-01 07:08:05] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 55 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Support contains 125 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 64 place count 518 transition count 460
Iterating global reduction 1 with 61 rules applied. Total rules applied 125 place count 518 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 151 place count 492 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 177 place count 492 transition count 434
Applied a total of 177 rules in 297 ms. Remains 492 /582 variables (removed 90) and now considering 434/521 (removed 87) transitions.
// Phase 1: matrix 434 rows 492 cols
[2024-06-01 07:08:05] [INFO ] Computed 95 invariants in 31 ms
[2024-06-01 07:08:06] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-06-01 07:08:06] [INFO ] Invariant cache hit.
[2024-06-01 07:08:06] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:08:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/492 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:22] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 25 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 76 places in 1839 ms of which 4 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:08:24] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 11 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:25] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:26] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 5 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 5 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 5 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 5 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 5 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 6 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 5 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/926 variables, and 155 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/492 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/492 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 7 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 5 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 8 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 6 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:50] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 5 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:08:51] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:08:52] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 6 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:08:53] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 4 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 4 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 91 places in 172 ms of which 7 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 4 ms to minimize.
SMT process timed out in 60349ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 492/582 places, 434/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62171 ms. Remains : 492/582 places, 434/521 transitions.
Support contains 125 out of 492 places after structural reductions.
[2024-06-01 07:09:07] [INFO ] Flatten gal took : 119 ms
[2024-06-01 07:09:07] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:09:07] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 124 out of 492 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (290 resets) in 2495 ms. (16 steps per ms) remains 36/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
[2024-06-01 07:09:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 208/285 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 99/384 variables, 25/52 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 5 (OVERLAPS) 101/485 variables, 42/94 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/486 variables, 1/95 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 430/916 variables, 486/581 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 2 ms to minimize.
SMT process timed out in 5096ms, After SMT, problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (complete) has 1083 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 491 transition count 393
Reduce places removed 40 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 44 rules applied. Total rules applied 85 place count 451 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 447 transition count 389
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 89 place count 447 transition count 309
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 260 place count 356 transition count 309
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 275 place count 341 transition count 294
Iterating global reduction 3 with 15 rules applied. Total rules applied 290 place count 341 transition count 294
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 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 497 place count 236 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 498 place count 236 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 236 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 235 transition count 190
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 507 place count 235 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 508 place count 234 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 509 place count 233 transition count 189
Applied a total of 509 rules in 134 ms. Remains 233 /492 variables (removed 259) and now considering 189/434 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 233/492 places, 189/434 transitions.
RANDOM walk for 40000 steps (2233 resets) in 1430 ms. (27 steps per ms) remains 31/34 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (39 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (42 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (42 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (41 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 329392 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :21 out of 31
Probabilistic random walk after 329392 steps, saw 57047 distinct states, run finished after 3004 ms. (steps per millisecond=109 ) properties seen :21
// Phase 1: matrix 189 rows 233 cols
[2024-06-01 07:09:18] [INFO ] Computed 80 invariants in 5 ms
[2024-06-01 07:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 94/119 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 64/188 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 6/194 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 186/380 variables, 194/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
Problem AtomicPropp29 is UNSAT
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
Problem AtomicPropp51 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 8/266 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 5/271 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 14 (OVERLAPS) 41/421 variables, 38/309 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 16/325 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/325 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/422 variables, 1/326 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 1/327 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/422 variables, 0/327 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/422 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/422 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/422 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 328 constraints, problems are : Problem set: 4 solved, 6 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/86 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/109 variables, 16/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/26 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 68/177 variables, 29/55 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/58 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/60 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/60 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/183 variables, 6/66 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/67 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 181/364 variables, 183/250 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 1/251 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 4/255 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 07:09:21] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 1/256 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 2/258 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 1/259 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/259 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 55/419 variables, 47/306 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/419 variables, 17/323 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 1/324 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 6/330 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/419 variables, 6/336 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/419 variables, 0/336 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 3/422 variables, 3/339 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/422 variables, 3/342 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/422 variables, 4/346 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/422 variables, 0/346 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/422 variables, 0/346 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 346 constraints, problems are : Problem set: 5 solved, 5 unsolved in 2258 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 27/27 constraints]
After SMT, in 5049ms problems are : Problem set: 5 solved, 5 unsolved
Parikh walk visited 0 properties in 803 ms.
Support contains 11 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 189/189 transitions.
Graph (trivial) has 46 edges and 233 vertex of which 2 / 233 are part of one of the 1 SCC in 15 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 232 transition count 180
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 225 transition count 180
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 15 place count 225 transition count 159
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 63 place count 198 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 193 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 193 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 73 place count 193 transition count 152
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 191 transition count 152
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 104 place count 177 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 176 transition count 156
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 176 transition count 153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 173 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 172 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 171 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 171 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 170 transition count 151
Applied a total of 116 rules in 99 ms. Remains 170 /233 variables (removed 63) and now considering 151/189 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 170/233 places, 151/189 transitions.
RANDOM walk for 40000 steps (2705 resets) in 265 ms. (150 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (967 resets) in 120 ms. (330 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (995 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
// Phase 1: matrix 151 rows 170 cols
[2024-06-01 07:09:24] [INFO ] Computed 72 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/75 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/117 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/123 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/268 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/320 variables, 46/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/321 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/321 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/75 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/117 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/123 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/268 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/320 variables, 46/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/321 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/321 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/321 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 17 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:09:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 86 out of 492 places (down from 98) after GAL structural reductions.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1083 edges and 492 vertex of which 491 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 241 edges and 492 vertex of which 6 / 492 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 1077 edges and 487 vertex of which 486 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 485 transition count 361
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 420 transition count 361
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 420 transition count 266
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 307 transition count 266
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 282 transition count 241
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 282 transition count 241
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 390 place count 282 transition count 237
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 398 place count 278 transition count 237
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 620 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 621 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 622 place count 163 transition count 127
Applied a total of 622 rules in 44 ms. Remains 163 /492 variables (removed 329) and now considering 127/434 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 163/492 places, 127/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 233 edges and 492 vertex of which 6 / 492 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 1077 edges and 487 vertex of which 486 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 485 transition count 363
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 422 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 128 place count 422 transition count 272
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 326 place count 315 transition count 272
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 350 place count 291 transition count 248
Iterating global reduction 2 with 24 rules applied. Total rules applied 374 place count 291 transition count 248
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 374 place count 291 transition count 245
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 380 place count 288 transition count 245
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 600 place count 176 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 601 place count 175 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 602 place count 174 transition count 136
Applied a total of 602 rules in 40 ms. Remains 174 /492 variables (removed 318) and now considering 136/434 (removed 298) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 174/492 places, 136/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 457 transition count 399
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 457 transition count 399
Applied a total of 70 rules in 39 ms. Remains 457 /492 variables (removed 35) and now considering 399/434 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 457/492 places, 399/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 399 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 44 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 455/492 places, 397/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 45 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 454/492 places, 396/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 236 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 485 transition count 362
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 421 transition count 362
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 130 place count 421 transition count 269
Deduced a syphon composed of 93 places in 1 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 334 place count 310 transition count 269
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 359 place count 285 transition count 244
Iterating global reduction 2 with 25 rules applied. Total rules applied 384 place count 285 transition count 244
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 384 place count 285 transition count 240
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 281 transition count 240
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 610 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 611 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 612 place count 168 transition count 132
Applied a total of 612 rules in 50 ms. Remains 168 /492 variables (removed 324) and now considering 132/434 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 168/492 places, 132/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 457 transition count 399
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 457 transition count 399
Applied a total of 70 rules in 50 ms. Remains 457 /492 variables (removed 35) and now considering 399/434 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 457/492 places, 399/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:26] [INFO ] Input system was already deterministic with 399 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 47 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 455/492 places, 397/434 transitions.
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 467 transition count 409
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 467 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 455 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 455 transition count 397
Applied a total of 74 rules in 51 ms. Remains 455 /492 variables (removed 37) and now considering 397/434 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 455/492 places, 397/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 45 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 454/492 places, 396/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 468 transition count 410
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 468 transition count 410
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 458 transition count 400
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 458 transition count 400
Applied a total of 68 rules in 45 ms. Remains 458 /492 variables (removed 34) and now considering 400/434 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 458/492 places, 400/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 469 transition count 411
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 469 transition count 411
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 459 transition count 401
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 459 transition count 401
Applied a total of 66 rules in 47 ms. Remains 459 /492 variables (removed 33) and now considering 401/434 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 459/492 places, 401/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Graph (trivial) has 243 edges and 492 vertex of which 6 / 492 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1077 edges and 487 vertex of which 486 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 485 transition count 360
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 419 transition count 360
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 134 place count 419 transition count 265
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 342 place count 306 transition count 265
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 368 place count 280 transition count 239
Iterating global reduction 2 with 26 rules applied. Total rules applied 394 place count 280 transition count 239
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 394 place count 280 transition count 234
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 404 place count 275 transition count 234
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 620 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 621 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 622 place count 163 transition count 127
Applied a total of 622 rules in 41 ms. Remains 163 /492 variables (removed 329) and now considering 127/434 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 163/492 places, 127/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-12-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 434/434 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 466 transition count 408
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 466 transition count 408
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 454 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 454 transition count 396
Applied a total of 76 rules in 47 ms. Remains 454 /492 variables (removed 38) and now considering 396/434 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 454/492 places, 396/434 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:27] [INFO ] Input system was already deterministic with 396 transitions.
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:27] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:09:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:09:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 492 places, 434 transitions and 1375 arcs took 3 ms.
Total runtime 83173 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-12-CTLFireability-2023-15

BK_STOP 1717225768160

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1231/ctl_0_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1231/ctl_1_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1231/ctl_2_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1231/ctl_3_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1231/ctl_4_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1231/ctl_5_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1231/ctl_6_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1231/ctl_7_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1231/ctl_8_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1231/ctl_9_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1231/ctl_10_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1231/ctl_11_
ctl formula name BusinessProcesses-PT-12-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1231/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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