Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716305696177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:34:58] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-21 15:34:58] [INFO ] Transformed 586 places.
[2024-05-21 15:34:58] [INFO ] Transformed 525 transitions.
[2024-05-21 15:34:58] [INFO ] Found NUPN structural information;
[2024-05-21 15:34:58] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 56 ms.
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 511 transition count 453
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 511 transition count 453
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 167 place count 483 transition count 425
Iterating global reduction 1 with 28 rules applied. Total rules applied 195 place count 483 transition count 425
Applied a total of 195 rules in 185 ms. Remains 483 /582 variables (removed 99) and now considering 425/521 (removed 96) transitions.
// Phase 1: matrix 425 rows 483 cols
[2024-05-21 15:34:58] [INFO ] Computed 95 invariants in 62 ms
[2024-05-21 15:34:59] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-21 15:34:59] [INFO ] Invariant cache hit.
[2024-05-21 15:35:00] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-21 15:35:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-21 15:35:10] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 25 ms to minimize.
[2024-05-21 15:35:10] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:35:10] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:35:10] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:35:10] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:35:11] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-21 15:35:12] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:35:13] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:35:14] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/135 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:35:15] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:35:16] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 4 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:35:17] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:35:18] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:35:18] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/155 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 15:35:21] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:35:21] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:35:21] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:35:21] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:35:22] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:23] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/175 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 15:35:24] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 2 ms to minimize.
[2024-05-21 15:35:24] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:35:24] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:35:24] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:35:25] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:35:26] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:35:27] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:35:27] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/195 constraints. Problems are: Problem set: 5 solved, 419 unsolved
[2024-05-21 15:35:27] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:35:27] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:35:27] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:35:28] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 2 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:35:29] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:35:30] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:35:30] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:35:30] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/215 constraints. Problems are: Problem set: 5 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/908 variables, and 215 constraints, problems are : Problem set: 5 solved, 419 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 5 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 39/39 constraints. Problems are: Problem set: 5 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/39 constraints. Problems are: Problem set: 5 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 52/91 constraints. Problems are: Problem set: 5 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 4/95 constraints. Problems are: Problem set: 5 solved, 419 unsolved
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 120/215 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 15:35:34] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:35:34] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 4 ms to minimize.
[2024-05-21 15:35:34] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:35:34] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:35:35] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:35:36] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:35:37] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:35:37] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:35:37] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:35:37] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/235 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 4 ms to minimize.
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:35:38] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:35:39] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:35:40] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/255 constraints. Problems are: Problem set: 7 solved, 417 unsolved
[2024-05-21 15:35:41] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:35:41] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:41] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:35:41] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:41] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:35:42] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:35:43] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:35:43] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 2 ms to minimize.
[2024-05-21 15:35:43] [INFO ] Deduced a trap composed of 120 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:35:43] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:35:43] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:35:44] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:35:44] [INFO ] Deduced a trap composed of 115 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:35:44] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/275 constraints. Problems are: Problem set: 11 solved, 413 unsolved
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 4 ms to minimize.
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 106 places in 192 ms of which 3 ms to minimize.
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:35:45] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:35:46] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:35:47] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:35:48] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/295 constraints. Problems are: Problem set: 11 solved, 413 unsolved
[2024-05-21 15:35:48] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:35:48] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:35:49] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:35:50] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:35:51] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:35:51] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:35:51] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:35:51] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:35:51] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
Problem TDEAD377 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/315 constraints. Problems are: Problem set: 13 solved, 411 unsolved
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:35:52] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:35:53] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 4 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:35:54] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:35:55] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:35:55] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 4 ms to minimize.
[2024-05-21 15:35:55] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:35:55] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
Problem TDEAD373 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 20/335 constraints. Problems are: Problem set: 14 solved, 410 unsolved
[2024-05-21 15:35:56] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:35:56] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:35:56] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:35:56] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:35:56] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:35:57] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:35:58] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:35:59] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:35:59] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 20/355 constraints. Problems are: Problem set: 19 solved, 405 unsolved
[2024-05-21 15:36:00] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 3 ms to minimize.
[2024-05-21 15:36:00] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:36:00] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
SMT process timed out in 60470ms, After SMT, problems are : Problem set: 19 solved, 405 unsolved
Search for dead transitions found 19 dead transitions in 60518ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/582 places, 406/521 transitions.
Applied a total of 0 rules in 13 ms. Remains 483 /483 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62138 ms. Remains : 483/582 places, 406/521 transitions.
Support contains 93 out of 483 places after structural reductions.
[2024-05-21 15:36:01] [INFO ] Flatten gal took : 112 ms
[2024-05-21 15:36:01] [INFO ] Flatten gal took : 53 ms
[2024-05-21 15:36:01] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 88 out of 483 places (down from 93) after GAL structural reductions.
RANDOM walk for 40000 steps (285 resets) in 1802 ms. (22 steps per ms) remains 28/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
// Phase 1: matrix 406 rows 483 cols
[2024-05-21 15:36:02] [INFO ] Computed 95 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 274/324 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 150/474 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 3/477 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 402/879 variables, 477/572 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/879 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 9/888 variables, 5/577 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/888 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 1/889 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/889 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/889 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 889/889 variables, and 578 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3111 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (OVERLAPS) 274/324 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 1/51 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-21 15:36:06] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:36:06] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:36:06] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:36:06] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:36:06] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 5 (OVERLAPS) 150/474 variables, 42/98 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:36:08] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:36:09] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:36:10] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:36:10] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:36:10] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:36:10] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:36:10] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 8266ms, After SMT, problems are : Problem set: 2 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 406/406 transitions.
Graph (trivial) has 201 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1029 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 477 transition count 355
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 434 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 432 transition count 353
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 92 place count 432 transition count 265
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 283 place count 329 transition count 265
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 292 place count 320 transition count 256
Iterating global reduction 3 with 9 rules applied. Total rules applied 301 place count 320 transition count 256
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 511 place count 215 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 513 place count 214 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 515 place count 214 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 517 place count 212 transition count 153
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 520 place count 212 transition count 153
Applied a total of 520 rules in 154 ms. Remains 212 /483 variables (removed 271) and now considering 153/406 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 212/483 places, 153/406 transitions.
RANDOM walk for 40000 steps (864 resets) in 777 ms. (51 steps per ms) remains 4/26 properties
BEST_FIRST walk for 40002 steps (253 resets) in 169 ms. (235 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (332 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (337 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (238 resets) in 72 ms. (547 steps per ms) remains 2/3 properties
// Phase 1: matrix 153 rows 212 cols
[2024-05-21 15:36:11] [INFO ] Computed 80 invariants in 5 ms
[2024-05-21 15:36:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 115/122 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/189 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 21/210 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/363 variables, 210/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 11/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/365 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 212/212 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 115/122 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 67/189 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:36:12] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 21/210 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 153/363 variables, 210/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 11/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:36:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/365 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 212/212 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3041 steps, including 54 resets, run visited all 1 properties in 24 ms. (steps per millisecond=126 )
Parikh walk visited 2 properties in 115 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-21 15:36:12] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:36:12] [INFO ] Flatten gal took : 46 ms
[2024-05-21 15:36:12] [INFO ] Input system was already deterministic with 406 transitions.
Computed a total of 468 stabilizing places and 391 stable transitions
Graph (complete) has 1036 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 386
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 386
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 377
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 377
Applied a total of 58 rules in 34 ms. Remains 454 /483 variables (removed 29) and now considering 377/406 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 454/483 places, 377/406 transitions.
[2024-05-21 15:36:12] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:36:12] [INFO ] Flatten gal took : 29 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 387
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 387
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 455 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 455 transition count 378
Applied a total of 56 rules in 36 ms. Remains 455 /483 variables (removed 28) and now considering 378/406 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 455/483 places, 378/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 30 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Graph (trivial) has 233 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1030 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 476 transition count 341
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 419 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 418 transition count 340
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 118 place count 418 transition count 243
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 330 place count 303 transition count 243
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 347 place count 286 transition count 226
Iterating global reduction 3 with 17 rules applied. Total rules applied 364 place count 286 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 364 place count 286 transition count 224
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 369 place count 283 transition count 224
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 229 rules applied. Total rules applied 598 place count 167 transition count 111
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 600 place count 166 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 601 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 164 transition count 109
Applied a total of 602 rules in 107 ms. Remains 164 /483 variables (removed 319) and now considering 109/406 (removed 297) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 164/483 places, 109/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 469 transition count 392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 469 transition count 392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 463 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 463 transition count 386
Applied a total of 40 rules in 26 ms. Remains 463 /483 variables (removed 20) and now considering 386/406 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 463/483 places, 386/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 465 transition count 388
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 465 transition count 388
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 456 transition count 379
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 456 transition count 379
Applied a total of 54 rules in 36 ms. Remains 456 /483 variables (removed 27) and now considering 379/406 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 456/483 places, 379/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Graph (trivial) has 233 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1030 edges and 478 vertex of which 477 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 476 transition count 340
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 418 transition count 340
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 118 place count 418 transition count 244
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 328 place count 304 transition count 244
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 346 place count 286 transition count 226
Iterating global reduction 2 with 18 rules applied. Total rules applied 364 place count 286 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 364 place count 286 transition count 224
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 369 place count 283 transition count 224
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 600 place count 166 transition count 110
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 602 place count 165 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 603 place count 164 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 604 place count 163 transition count 108
Applied a total of 604 rules in 66 ms. Remains 163 /483 variables (removed 320) and now considering 108/406 (removed 298) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 163/483 places, 108/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 387
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 387
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 455 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 455 transition count 378
Applied a total of 56 rules in 32 ms. Remains 455 /483 variables (removed 28) and now considering 378/406 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 455/483 places, 378/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 465 transition count 388
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 465 transition count 388
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 457 transition count 380
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 457 transition count 380
Applied a total of 52 rules in 31 ms. Remains 457 /483 variables (removed 26) and now considering 380/406 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 457/483 places, 380/406 transitions.
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:36:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:36:13] [INFO ] Input system was already deterministic with 380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 387
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 456 transition count 379
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 456 transition count 379
Applied a total of 54 rules in 32 ms. Remains 456 /483 variables (removed 27) and now considering 379/406 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 456/483 places, 379/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 466 transition count 389
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 466 transition count 389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 458 transition count 381
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 458 transition count 381
Applied a total of 50 rules in 45 ms. Remains 458 /483 variables (removed 25) and now considering 381/406 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 458/483 places, 381/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 386
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 386
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 377
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 377
Applied a total of 58 rules in 39 ms. Remains 454 /483 variables (removed 29) and now considering 377/406 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 454/483 places, 377/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 24 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 386
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 386
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 454 transition count 377
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 454 transition count 377
Applied a total of 58 rules in 32 ms. Remains 454 /483 variables (removed 29) and now considering 377/406 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 454/483 places, 377/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 464 transition count 387
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 464 transition count 387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 456 transition count 379
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 456 transition count 379
Applied a total of 54 rules in 19 ms. Remains 456 /483 variables (removed 27) and now considering 379/406 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 456/483 places, 379/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 406/406 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 466 transition count 389
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 466 transition count 389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 459 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 459 transition count 382
Applied a total of 48 rules in 31 ms. Remains 459 /483 variables (removed 24) and now considering 382/406 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 459/483 places, 382/406 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:36:14] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:36:14] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:36:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 15:36:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 483 places, 406 transitions and 1243 arcs took 20 ms.
Total runtime 76702 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 483
TRANSITIONS: 406
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]


SAVING FILE /home/mcc/execution/423/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1463
MODEL NAME: /home/mcc/execution/423/model
483 places, 406 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-12-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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