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-171620399800561.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-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225883126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:24] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 07:11:24] [INFO ] Transformed 630 places.
[2024-06-01 07:11:24] [INFO ] Transformed 566 transitions.
[2024-06-01 07:11:24] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:24] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 548 transition count 487
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 548 transition count 487
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 517 transition count 456
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 517 transition count 456
Applied a total of 215 rules in 117 ms. Remains 517 /626 variables (removed 109) and now considering 456/562 (removed 106) transitions.
// Phase 1: matrix 456 rows 517 cols
[2024-06-01 07:11:24] [INFO ] Computed 99 invariants in 27 ms
[2024-06-01 07:11:25] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-06-01 07:11:25] [INFO ] Invariant cache hit.
[2024-06-01 07:11:25] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-01 07:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 29 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 96 places in 189 ms of which 6 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 20/139 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 104 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 6 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/159 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 5 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 20/179 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 20/199 constraints. Problems are: Problem set: 11 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/973 variables, and 199 constraints, problems are : Problem set: 11 solved, 444 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/517 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 11 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 39/39 constraints. Problems are: Problem set: 11 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 58/97 constraints. Problems are: Problem set: 11 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 2/99 constraints. Problems are: Problem set: 11 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 100/199 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 20/219 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/239 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 20/259 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 20/279 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 20/299 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 20/319 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 20/339 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 130 places in 100 ms of which 4 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/973 variables, and 359 constraints, problems are : Problem set: 11 solved, 444 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/517 constraints, PredecessorRefiner: 0/455 constraints, Known Traps: 260/260 constraints]
After SMT, in 60211ms problems are : Problem set: 11 solved, 444 unsolved
Search for dead transitions found 11 dead transitions in 60231ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 517/626 places, 445/562 transitions.
Applied a total of 0 rules in 54 ms. Remains 517 /517 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61290 ms. Remains : 517/626 places, 445/562 transitions.
Support contains 101 out of 517 places after structural reductions.
[2024-06-01 07:12:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:12:26] [INFO ] Flatten gal took : 72 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:12:26] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:12:26] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 97 out of 517 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (271 resets) in 1948 ms. (20 steps per ms) remains 29/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
// Phase 1: matrix 445 rows 517 cols
[2024-06-01 07:12:27] [INFO ] Computed 99 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 255/319 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 41/360 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 149/509 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 4/513 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 443/956 variables, 513/612 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 6/962 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/962 variables, 20/636 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/962 variables, and 636 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 255/319 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 41/360 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 10 (OVERLAPS) 149/509 variables, 39/111 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 7/118 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 20/138 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 10044ms, After SMT, problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 206 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1120 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 511 transition count 395
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 469 transition count 389
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 463 transition count 389
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 98 place count 463 transition count 303
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 283 place count 364 transition count 303
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 293 place count 354 transition count 293
Iterating global reduction 3 with 10 rules applied. Total rules applied 303 place count 354 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 303 place count 354 transition count 291
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 307 place count 352 transition count 291
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 493 place count 259 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 495 place count 258 transition count 202
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 497 place count 258 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 499 place count 256 transition count 200
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 256 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 255 transition count 199
Applied a total of 502 rules in 173 ms. Remains 255 /517 variables (removed 262) and now considering 199/445 (removed 246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 255/517 places, 199/445 transitions.
RANDOM walk for 40000 steps (453 resets) in 787 ms. (50 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40001 steps (132 resets) in 118 ms. (336 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (151 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
// Phase 1: matrix 199 rows 255 cols
[2024-06-01 07:12:37] [INFO ] Computed 86 invariants in 3 ms
[2024-06-01 07:12:37] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/155 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/245 variables, 26/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/247 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/443 variables, 247/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/453 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/454 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/454 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/454 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/155 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/184 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/245 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/247 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 196/443 variables, 247/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/453 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/453 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/454 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 8 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/454 variables, 15/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/454 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/454 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
After SMT, in 1962ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 07:12:39] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:12:39] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:12:39] [INFO ] Input system was already deterministic with 445 transitions.
Computed a total of 222 stabilizing places and 194 stable transitions
Graph (complete) has 1127 edges and 517 vertex of which 516 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 256 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 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 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 510 transition count 373
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 130 place count 446 transition count 270
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 356 place count 323 transition count 270
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 380 place count 299 transition count 246
Iterating global reduction 2 with 24 rules applied. Total rules applied 404 place count 299 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 404 place count 299 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 413 place count 294 transition count 242
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 654 place count 172 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 655 place count 171 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 170 transition count 122
Applied a total of 656 rules in 60 ms. Remains 170 /517 variables (removed 347) and now considering 122/445 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 170/517 places, 122/445 transitions.
[2024-06-01 07:12:39] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:12:39] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 23 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 488/517 places, 416/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 487 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 487 transition count 415
Applied a total of 60 rules in 29 ms. Remains 487 /517 variables (removed 30) and now considering 415/445 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 487/517 places, 415/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 493 transition count 421
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 493 transition count 421
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 484 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 484 transition count 412
Applied a total of 66 rules in 24 ms. Remains 484 /517 variables (removed 33) and now considering 412/445 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 484/517 places, 412/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 23 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 488/517 places, 416/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 423
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 423
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 488 transition count 416
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 23 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 488/517 places, 416/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 255 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 510 transition count 373
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 130 place count 446 transition count 271
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 353 place count 325 transition count 271
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 377 place count 301 transition count 247
Iterating global reduction 2 with 24 rules applied. Total rules applied 401 place count 301 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 401 place count 301 transition count 243
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 410 place count 296 transition count 243
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 655 place count 172 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 171 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 657 place count 170 transition count 121
Applied a total of 657 rules in 64 ms. Remains 170 /517 variables (removed 347) and now considering 121/445 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 170/517 places, 121/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 121 transitions.
RANDOM walk for 40000 steps (8305 resets) in 403 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33930 steps (2042 resets) in 84 ms. (399 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 494 transition count 422
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 494 transition count 422
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 485 transition count 413
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 485 transition count 413
Applied a total of 64 rules in 34 ms. Remains 485 /517 variables (removed 32) and now considering 413/445 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 485/517 places, 413/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 249 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 510 transition count 377
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 450 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 449 transition count 376
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 124 place count 449 transition count 273
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 349 place count 327 transition count 273
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 370 place count 306 transition count 252
Iterating global reduction 3 with 21 rules applied. Total rules applied 391 place count 306 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 391 place count 306 transition count 249
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 397 place count 303 transition count 249
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 630 place count 186 transition count 133
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 636 place count 186 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 185 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 184 transition count 132
Applied a total of 638 rules in 60 ms. Remains 184 /517 variables (removed 333) and now considering 132/445 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 184/517 places, 132/445 transitions.
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:40] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:40] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 423
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 423
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 487 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 487 transition count 415
Applied a total of 60 rules in 65 ms. Remains 487 /517 variables (removed 30) and now considering 415/445 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 487/517 places, 415/445 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:41] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 254 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 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 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 510 transition count 374
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 447 transition count 374
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 128 place count 447 transition count 271
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 354 place count 324 transition count 271
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 377 place count 301 transition count 248
Iterating global reduction 2 with 23 rules applied. Total rules applied 400 place count 301 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 400 place count 301 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 296 transition count 244
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 650 place count 174 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 173 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 172 transition count 124
Applied a total of 652 rules in 51 ms. Remains 172 /517 variables (removed 345) and now considering 124/445 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 172/517 places, 124/445 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:41] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 490 transition count 418
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 490 transition count 418
Applied a total of 54 rules in 44 ms. Remains 490 /517 variables (removed 27) and now considering 418/445 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 490/517 places, 418/445 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:12:41] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 253 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 510 transition count 375
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 448 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 130 place count 446 transition count 272
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 351 place count 326 transition count 272
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 374 place count 303 transition count 249
Iterating global reduction 3 with 23 rules applied. Total rules applied 397 place count 303 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 397 place count 303 transition count 245
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 406 place count 298 transition count 245
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 649 place count 175 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 174 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 173 transition count 124
Applied a total of 651 rules in 50 ms. Remains 173 /517 variables (removed 344) and now considering 124/445 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 173/517 places, 124/445 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:41] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 240 edges and 517 vertex of which 6 / 517 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 1121 edges and 512 vertex of which 511 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 378
Reduce places removed 59 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 451 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 449 transition count 376
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 449 transition count 282
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 328 place count 339 transition count 282
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 347 place count 320 transition count 263
Iterating global reduction 3 with 19 rules applied. Total rules applied 366 place count 320 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 366 place count 320 transition count 261
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 371 place count 317 transition count 261
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 613 place count 195 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 194 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 193 transition count 140
Applied a total of 615 rules in 48 ms. Remains 193 /517 variables (removed 324) and now considering 140/445 (removed 305) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 193/517 places, 140/445 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:41] [INFO ] Input system was already deterministic with 140 transitions.
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:12:41] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:12:41] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:12:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 517 places, 445 transitions and 1377 arcs took 3 ms.
Total runtime 77102 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-15-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-2023-13

BK_STOP 1717225961707

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1570/ctl_0_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1570/ctl_1_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1570/ctl_2_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1570/ctl_3_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1570/ctl_4_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1570/ctl_5_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1570/ctl_6_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1570/ctl_7_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1570/ctl_8_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1570/ctl_9_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1570/ctl_10_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1570/ctl_11_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1570/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-15"
export BK_EXAMINATION="CTLCardinality"
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-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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