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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 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 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225821535

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:10:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:23] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-06-01 07:10:23] [INFO ] Transformed 624 places.
[2024-06-01 07:10:23] [INFO ] Transformed 564 transitions.
[2024-06-01 07:10:23] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:23] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 8 transitions.
Support contains 135 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 73 place count 543 transition count 488
Iterating global reduction 1 with 68 rules applied. Total rules applied 141 place count 543 transition count 488
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 175 place count 509 transition count 454
Iterating global reduction 1 with 34 rules applied. Total rules applied 209 place count 509 transition count 454
Applied a total of 209 rules in 150 ms. Remains 509 /616 variables (removed 107) and now considering 454/556 (removed 102) transitions.
// Phase 1: matrix 454 rows 509 cols
[2024-06-01 07:10:23] [INFO ] Computed 94 invariants in 37 ms
[2024-06-01 07:10:24] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-06-01 07:10:24] [INFO ] Invariant cache hit.
[2024-06-01 07:10:24] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-06-01 07:10:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 27 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 121 places in 184 ms of which 4 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 116 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 122 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 6 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 4 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 106 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 6 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 7 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 107 places in 195 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/963 variables, and 194 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/509 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/509 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/509 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 6 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 5 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 99 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 107 places in 234 ms of which 6 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 80 places in 253 ms of which 5 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 84 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 112 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 6 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 107 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 98 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 96 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 6 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 5 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 94 places in 207 ms of which 5 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 96 places in 191 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 5 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 6 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 93 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 102 places in 255 ms of which 6 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 99 places in 227 ms of which 5 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 5 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 5 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 101 places in 776 ms of which 4 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 99 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 95 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 60279ms, After SMT, problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in LTL mode, iteration 1 : 509/616 places, 454/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61347 ms. Remains : 509/616 places, 454/556 transitions.
Support contains 135 out of 509 places after structural reductions.
[2024-06-01 07:11:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:11:25] [INFO ] Flatten gal took : 85 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:11:25] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:11:25] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 129 out of 509 places (down from 135) after GAL structural reductions.
RANDOM walk for 40000 steps (272 resets) in 2934 ms. (13 steps per ms) remains 51/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
[2024-06-01 07:11:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 292/393 variables, 50/51 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 16/409 variables, 5/56 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 49 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 6 (OVERLAPS) 92/501 variables, 38/94 constraints. Problems are: Problem set: 3 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 449/950 variables, 501/595 constraints. Problems are: Problem set: 3 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/950 variables, 0/595 constraints. Problems are: Problem set: 3 solved, 48 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 10 (OVERLAPS) 12/962 variables, 7/602 constraints. Problems are: Problem set: 6 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 0/602 constraints. Problems are: Problem set: 6 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 1/963 variables, 1/603 constraints. Problems are: Problem set: 6 solved, 45 unsolved
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 3 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:32] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
SMT process timed out in 5114ms, After SMT, problems are : Problem set: 6 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 508 transition count 414
Reduce places removed 39 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 46 rules applied. Total rules applied 86 place count 469 transition count 407
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 462 transition count 407
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 93 place count 462 transition count 334
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 247 place count 381 transition count 334
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 253 place count 375 transition count 328
Iterating global reduction 3 with 6 rules applied. Total rules applied 259 place count 375 transition count 328
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 465 place count 270 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 466 place count 270 transition count 226
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 471 place count 270 transition count 226
Applied a total of 471 rules in 147 ms. Remains 270 /509 variables (removed 239) and now considering 226/454 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 270/509 places, 226/454 transitions.
RANDOM walk for 40000 steps (1216 resets) in 1386 ms. (28 steps per ms) remains 38/44 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (17 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (18 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 28 ms. (138 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (19 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (19 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (20 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (20 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (22 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (21 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
// Phase 1: matrix 226 rows 270 cols
[2024-06-01 07:11:33] [INFO ] Computed 82 invariants in 7 ms
[2024-06-01 07:11:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 98/166 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 51/217 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 49/266 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/267 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 226/493 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 3/496 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/496 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 353 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/166 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 36 unsolved
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 14 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 13 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 60 places in 2704 ms of which 27 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/49 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 5 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 7/56 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/58 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 51/217 variables, 27/89 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 20/109 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 20/129 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:45] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:46] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 20/149 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 20/169 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 3 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 20/189 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:11:52] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 20/209 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 20/229 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 20/249 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/217 variables, 4/253 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/217 variables, 16/269 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 20/289 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 12/301 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/217 variables, 3/304 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/217 variables, 3/307 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/217 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 23 (OVERLAPS) 49/266 variables, 25/332 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/266 variables, 6/338 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/266 variables, 6/344 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 4 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/266 variables, 14/358 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 66 places in 4359 ms of which 29 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/266 variables, 3/361 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/266 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 29 (OVERLAPS) 1/267 variables, 1/362 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/267 variables, 0/362 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 31 (OVERLAPS) 226/493 variables, 267/629 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/493 variables, 1/630 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/493 variables, 35/665 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 47033ms, After SMT, problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 226/226 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 270 transition count 222
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 266 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 265 transition count 221
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 10 place count 265 transition count 213
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 29 place count 254 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 252 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 252 transition count 211
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 62 place count 237 transition count 197
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 237 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 236 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 235 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 234 transition count 195
Applied a total of 66 rules in 84 ms. Remains 234 /270 variables (removed 36) and now considering 195/226 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 234/270 places, 195/226 transitions.
RANDOM walk for 40000 steps (1561 resets) in 1355 ms. (29 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (27 resets) in 79 ms. (50 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (25 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 323417 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :26 out of 33
Probabilistic random walk after 323417 steps, saw 62047 distinct states, run finished after 3006 ms. (steps per millisecond=107 ) properties seen :26
// Phase 1: matrix 195 rows 234 cols
[2024-06-01 07:12:24] [INFO ] Computed 77 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 75/86 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 22/108 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 56/164 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 4/168 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/170 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 184/354 variables, 170/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 73/427 variables, 62/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 24/312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 1/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1/428 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/428 variables, 1/315 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/428 variables, 0/315 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1/429 variables, 1/316 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/429 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 316 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2332 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 36/100 variables, 20/23 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/24 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 8/108 variables, 2/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 56/164 variables, 21/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/168 variables, 4/53 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/170 variables, 2/55 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/170 variables, 2/57 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 184/354 variables, 170/227 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 3/230 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 73/427 variables, 62/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 24/316 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/427 variables, 2/318 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/427 variables, 1/319 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 56 places in 353 ms of which 29 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/427 variables, 1/320 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/427 variables, 0/320 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 1/428 variables, 1/321 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 1/322 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/428 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/429 variables, 1/323 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/429 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 0/429 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 323 constraints, problems are : Problem set: 2 solved, 5 unsolved in 6106 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 7/7 constraints]
After SMT, in 8464ms problems are : Problem set: 2 solved, 5 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 367 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:12:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 41 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:12:33] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 81 out of 509 places (down from 90) after GAL structural reductions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 1124 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 252 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 146 place count 429 transition count 278
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 352 place count 318 transition count 278
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 378 place count 292 transition count 252
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 405 place count 291 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 405 place count 291 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 411 place count 288 transition count 249
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 639 place count 172 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 171 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 170 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 643 place count 169 transition count 135
Applied a total of 643 rules in 104 ms. Remains 169 /509 variables (removed 340) and now considering 135/454 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 169/509 places, 135/454 transitions.
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:12:33] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 468 transition count 413
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 39 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 468/509 places, 413/454 transitions.
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:12:33] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 479 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 479 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 34 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 470/509 places, 415/454 transitions.
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:33] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 37 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 471/509 places, 416/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 471 transition count 416
Applied a total of 76 rules in 21 ms. Remains 471 /509 variables (removed 38) and now considering 416/454 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 471/509 places, 416/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 250 edges and 509 vertex of which 4 / 509 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1121 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 504 transition count 378
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 433 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 432 transition count 377
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 146 place count 432 transition count 281
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 354 place count 320 transition count 281
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 382 place count 292 transition count 253
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 411 place count 291 transition count 253
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 411 place count 291 transition count 250
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 417 place count 288 transition count 250
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 643 place count 173 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 645 place count 172 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 171 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 647 place count 170 transition count 137
Applied a total of 647 rules in 91 ms. Remains 170 /509 variables (removed 339) and now considering 137/454 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 170/509 places, 137/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 483 transition count 428
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 483 transition count 428
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 473 transition count 418
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 473 transition count 418
Applied a total of 72 rules in 47 ms. Remains 473 /509 variables (removed 36) and now considering 418/454 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 473/509 places, 418/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 467 transition count 412
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 467 transition count 412
Applied a total of 84 rules in 20 ms. Remains 467 /509 variables (removed 42) and now considering 412/454 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 467/509 places, 412/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 480 transition count 425
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 480 transition count 425
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 470 transition count 415
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 470 transition count 415
Applied a total of 78 rules in 34 ms. Remains 470 /509 variables (removed 39) and now considering 415/454 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 470/509 places, 415/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 478 transition count 423
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 478 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 468 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 468 transition count 413
Applied a total of 82 rules in 18 ms. Remains 468 /509 variables (removed 41) and now considering 413/454 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 468/509 places, 413/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 257 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 501 transition count 373
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 146 place count 429 transition count 275
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 359 place count 314 transition count 275
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 388 place count 285 transition count 246
Ensure Unique test removed 1 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 418 place count 284 transition count 246
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 418 place count 284 transition count 243
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 424 place count 281 transition count 243
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 57 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 165/509 places, 132/454 transitions.
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:12:34] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:12:34] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 477 transition count 422
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 477 transition count 422
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 466 transition count 411
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 466 transition count 411
Applied a total of 86 rules in 44 ms. Remains 466 /509 variables (removed 43) and now considering 411/454 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 466/509 places, 411/454 transitions.
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:12:35] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 509/509 places, 454/454 transitions.
Graph (trivial) has 255 edges and 509 vertex of which 7 / 509 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1117 edges and 503 vertex of which 502 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 501 transition count 374
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 430 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 429 transition count 373
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 146 place count 429 transition count 276
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 357 place count 315 transition count 276
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 386 place count 286 transition count 247
Ensure Unique test removed 1 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 416 place count 285 transition count 247
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 416 place count 285 transition count 244
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 422 place count 282 transition count 244
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 646 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 648 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 649 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 650 place count 165 transition count 132
Applied a total of 650 rules in 72 ms. Remains 165 /509 variables (removed 344) and now considering 132/454 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 165/509 places, 132/454 transitions.
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:12:35] [INFO ] Input system was already deterministic with 132 transitions.
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:12:35] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:12:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:12:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 509 places, 454 transitions and 1432 arcs took 8 ms.
Total runtime 132136 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-14-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-14-CTLFireability-2023-14

BK_STOP 1717225955725

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2117/ctl_0_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2117/ctl_1_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2117/ctl_2_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2117/ctl_3_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2117/ctl_4_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2117/ctl_5_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2117/ctl_6_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2117/ctl_7_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2117/ctl_8_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/2117/ctl_9_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2117/ctl_10_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/2117/ctl_11_
ctl formula name BusinessProcesses-PT-14-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/2117/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-14"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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