Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921200082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 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 MedleyA-PT-11-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717356164068

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:22:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:22:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:22:46] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-02 19:22:46] [INFO ] Transformed 150 places.
[2024-06-02 19:22:46] [INFO ] Transformed 478 transitions.
[2024-06-02 19:22:46] [INFO ] Found NUPN structural information;
[2024-06-02 19:22:46] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 97 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 130 transition count 443
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 130 transition count 443
Applied a total of 40 rules in 45 ms. Remains 130 /150 variables (removed 20) and now considering 443/469 (removed 26) transitions.
[2024-06-02 19:22:46] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
// Phase 1: matrix 371 rows 130 cols
[2024-06-02 19:22:47] [INFO ] Computed 23 invariants in 29 ms
[2024-06-02 19:22:47] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-02 19:22:47] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
[2024-06-02 19:22:47] [INFO ] Invariant cache hit.
[2024-06-02 19:22:47] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 19:22:47] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-06-02 19:22:47] [INFO ] Flow matrix only has 371 transitions (discarded 72 similar events)
[2024-06-02 19:22:47] [INFO ] Invariant cache hit.
[2024-06-02 19:22:47] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/130 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 19 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 2 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:22:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:22:54] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:22:55] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:22:55] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2024-06-02 19:22:55] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 2 ms to minimize.
[2024-06-02 19:22:55] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 13 ms to minimize.
[2024-06-02 19:22:55] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:22:57] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:22:58] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 3 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:22:59] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:23:00] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/63 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:00] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:23:00] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:23:00] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:23:01] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:23:02] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-06-02 19:23:03] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 3 ms to minimize.
[2024-06-02 19:23:03] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 12/75 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:03] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-06-02 19:23:04] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-06-02 19:23:04] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:23:04] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 6 ms to minimize.
[2024-06-02 19:23:06] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:23:06] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:23:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:23:06] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:23:07] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-06-02 19:23:07] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/85 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:09] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 3 ms to minimize.
[2024-06-02 19:23:09] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/87 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:12] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/88 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:14] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:23:14] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 2/90 constraints. Problems are: Problem set: 108 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/501 variables, and 90 constraints, problems are : Problem set: 108 solved, 334 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/130 constraints, ReadFeed: 0/171 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 108 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 67/90 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:22] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-02 19:23:24] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 371/501 variables, 130/222 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 171/393 constraints. Problems are: Problem set: 108 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 334/727 constraints. Problems are: Problem set: 108 solved, 334 unsolved
[2024-06-02 19:23:46] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 728 constraints, problems are : Problem set: 108 solved, 334 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 334/442 constraints, Known Traps: 70/70 constraints]
After SMT, in 61234ms problems are : Problem set: 108 solved, 334 unsolved
Search for dead transitions found 108 dead transitions in 61278ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/150 places, 335/469 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62379 ms. Remains : 130/150 places, 335/469 transitions.
Support contains 97 out of 130 places after structural reductions.
[2024-06-02 19:23:49] [INFO ] Flatten gal took : 98 ms
[2024-06-02 19:23:49] [INFO ] Flatten gal took : 44 ms
[2024-06-02 19:23:49] [INFO ] Input system was already deterministic with 335 transitions.
Reduction of identical properties reduced properties to check from 93 to 92
RANDOM walk for 40000 steps (3144 resets) in 3167 ms. (12 steps per ms) remains 59/92 properties
BEST_FIRST walk for 4003 steps (54 resets) in 60 ms. (65 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (55 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (60 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (44 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (50 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (57 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 33 ms. (117 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (51 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (52 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (55 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (48 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (43 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (54 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (42 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (54 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (49 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (47 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (48 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (46 resets) in 21 ms. (181 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (45 resets) in 32 ms. (121 steps per ms) remains 53/56 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (54 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (49 resets) in 58 ms. (67 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (51 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (46 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (56 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (50 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (47 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (47 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (59 resets) in 52 ms. (75 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (64 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
// Phase 1: matrix 335 rows 130 cols
[2024-06-02 19:23:51] [INFO ] Computed 23 invariants in 14 ms
[2024-06-02 19:23:51] [INFO ] State equation strengthened by 135 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 24/97 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 43 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 3 (OVERLAPS) 31/128 variables, 14/23 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:52] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/24 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 333/461 variables, 128/152 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 135/287 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/287 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 4/465 variables, 2/289 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/289 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/465 variables, 0/289 constraints. Problems are: Problem set: 20 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 289 constraints, problems are : Problem set: 20 solved, 33 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 20 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 23/80 variables, 6/6 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 9/89 variables, 3/9 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/10 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 36/125 variables, 13/23 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/24 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:23:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 12/36 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:23:55] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 4/40 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/41 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 2/43 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:23:57] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 2/45 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 3/128 variables, 1/46 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 0/46 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 333/461 variables, 128/174 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 135/309 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 11/320 constraints. Problems are: Problem set: 20 solved, 33 unsolved
[2024-06-02 19:23:58] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
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 Int declared 461/465 variables, and 321 constraints, problems are : Problem set: 20 solved, 33 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 128/130 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 11/53 constraints, Known Traps: 24/24 constraints]
After SMT, in 7496ms problems are : Problem set: 20 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 652 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 333
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 120 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 120 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 120 transition count 319
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 120 transition count 317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 117 transition count 317
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 40 place count 117 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 113 transition count 311
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 113 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 113 transition count 307
Applied a total of 52 rules in 173 ms. Remains 113 /130 variables (removed 17) and now considering 307/335 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 113/130 places, 307/335 transitions.
RANDOM walk for 40000 steps (2941 resets) in 1059 ms. (37 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (50 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (54 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (61 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (55 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (50 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (54 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (54 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (54 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (49 resets) in 25 ms. (154 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (53 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (53 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (54 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (54 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (51 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (53 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (52 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (44 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
// Phase 1: matrix 307 rows 113 cols
[2024-06-02 19:23:59] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 19:23:59] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 28/81 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 9/90 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 23/113 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 307/420 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 131/266 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/420 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 266 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 113/113 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 28/81 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 9/90 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:01] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 23/113 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:24:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:24:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 307/420 variables, 113/151 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 131/282 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 29/311 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:05] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/420 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 316 constraints, problems are : Problem set: 0 solved, 29 unsolved in 8428 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 113/113 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 21/21 constraints]
After SMT, in 10054ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 19 properties in 18302 ms.
Support contains 26 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 307/307 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 108 transition count 295
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 108 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 286
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 102 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 101 transition count 284
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 101 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 282
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 99 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 97 transition count 281
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 97 transition count 281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 96 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 96 transition count 279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 94 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 94 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 93 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 93 transition count 264
Applied a total of 49 rules in 64 ms. Remains 93 /113 variables (removed 20) and now considering 264/307 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 93/113 places, 264/307 transitions.
RANDOM walk for 40000 steps (3288 resets) in 306 ms. (130 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (575 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (544 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (723 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (568 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (569 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (573 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (475 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (582 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
// Phase 1: matrix 264 rows 93 cols
[2024-06-02 19:24:28] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 19:24:28] [INFO ] State equation strengthened by 123 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 38/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 22/88 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 4/92 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 264/356 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 123/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/357 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/357 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 238 constraints, problems are : Problem set: 0 solved, 8 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 38/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:24:29] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 8/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 22/88 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:24:29] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:24:29] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:24:29] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:24:29] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/92 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 264/356 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 123/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/357 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:24:30] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/357 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/357 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/357 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 252 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2293 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 93/93 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 4 properties in 2511 ms.
Support contains 12 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 264/264 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 88 transition count 259
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 88 transition count 259
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 86 transition count 247
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 86 transition count 247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 85 transition count 258
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 85 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 83 transition count 310
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 25 place count 83 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 82 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 82 transition count 304
Applied a total of 27 rules in 54 ms. Remains 82 /93 variables (removed 11) and now considering 304/264 (removed -40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 82/93 places, 304/264 transitions.
RANDOM walk for 40000 steps (4263 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (810 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (900 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (820 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (778 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 472655 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 4
Probabilistic random walk after 472655 steps, saw 101036 distinct states, run finished after 3013 ms. (steps per millisecond=156 ) properties seen :0
// Phase 1: matrix 304 rows 82 cols
[2024-06-02 19:24:37] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 19:24:37] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/71 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/81 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 304/385 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 138/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/386 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 240 constraints, problems are : Problem set: 0 solved, 4 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 82/82 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:24:37] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:24:37] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/71 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:24:38] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:24:38] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 304/385 variables, 81/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 138/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:24:38] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/386 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/386 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 249 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 82/82 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 2202ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 438 ms.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 304/304 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 82 transition count 450
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 27 place count 79 transition count 429
Applied a total of 27 rules in 31 ms. Remains 79 /82 variables (removed 3) and now considering 429/304 (removed -125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 79/82 places, 429/304 transitions.
RANDOM walk for 40000 steps (4675 resets) in 357 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (936 resets) in 99 ms. (400 steps per ms) remains 1/2 properties
BEST_FIRST walk for 37158 steps (893 resets) in 80 ms. (458 steps per ms) remains 0/1 properties
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:24:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 41 ms
FORMULA MedleyA-PT-11-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 45 ms
[2024-06-02 19:24:40] [INFO ] Input system was already deterministic with 335 transitions.
Support contains 77 out of 130 places (down from 79) after GAL structural reductions.
Computed a total of 22 stabilizing places and 130 stable transitions
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 109 transition count 293
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 109 transition count 293
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 103 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 103 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 99 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 99 transition count 246
Applied a total of 59 rules in 16 ms. Remains 99 /130 variables (removed 31) and now considering 246/335 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 99/130 places, 246/335 transitions.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:24:40] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 107 transition count 294
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 107 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 44 place count 100 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 51 place count 100 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 55 place count 96 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 59 place count 96 transition count 240
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 0 with 2 rules applied. Total rules applied 61 place count 95 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 95 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 67 place count 93 transition count 235
Applied a total of 67 rules in 50 ms. Remains 93 /130 variables (removed 37) and now considering 235/335 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 93/130 places, 235/335 transitions.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 33 ms
[2024-06-02 19:24:40] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 335
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 111 transition count 296
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 111 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 106 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 106 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 103 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 103 transition count 257
Applied a total of 53 rules in 7 ms. Remains 103 /130 variables (removed 27) and now considering 257/335 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 103/130 places, 257/335 transitions.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:24:40] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 108 transition count 293
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 108 transition count 293
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 99 transition count 245
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 99 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 94 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 94 transition count 225
Applied a total of 70 rules in 7 ms. Remains 94 /130 variables (removed 36) and now considering 225/335 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 94/130 places, 225/335 transitions.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:24:40] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 100 transition count 249
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 100 transition count 249
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 96 transition count 233
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 96 transition count 233
Applied a total of 66 rules in 6 ms. Remains 96 /130 variables (removed 34) and now considering 233/335 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 96/130 places, 233/335 transitions.
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:40] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 233 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 109 transition count 290
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 109 transition count 290
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 101 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 101 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 97 transition count 231
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 97 transition count 231
Applied a total of 64 rules in 5 ms. Remains 97 /130 variables (removed 33) and now considering 231/335 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/130 places, 231/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Graph (complete) has 833 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 108 transition count 294
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 108 transition count 294
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 45 place count 100 transition count 252
Iterating global reduction 0 with 8 rules applied. Total rules applied 53 place count 100 transition count 252
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 94 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 94 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 67 place count 93 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 93 transition count 224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 90 transition count 221
Applied a total of 76 rules in 28 ms. Remains 90 /130 variables (removed 40) and now considering 221/335 (removed 114) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 90/130 places, 221/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 98 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 98 transition count 239
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 93 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 93 transition count 219
Applied a total of 72 rules in 5 ms. Remains 93 /130 variables (removed 37) and now considering 219/335 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 93/130 places, 219/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 106 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 106 transition count 287
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 98 transition count 244
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 98 transition count 244
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 93 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 93 transition count 224
Applied a total of 71 rules in 6 ms. Remains 93 /130 variables (removed 37) and now considering 224/335 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 93/130 places, 224/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 107 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 107 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 100 transition count 251
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 100 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 97 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 97 transition count 239
Applied a total of 63 rules in 5 ms. Remains 97 /130 variables (removed 33) and now considering 239/335 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/130 places, 239/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 239 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 108 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 108 transition count 289
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 101 transition count 252
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 101 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 96 transition count 232
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 96 transition count 232
Applied a total of 66 rules in 5 ms. Remains 96 /130 variables (removed 34) and now considering 232/335 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 96/130 places, 232/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 112 transition count 298
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 112 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 107 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 107 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 103 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 103 transition count 256
Applied a total of 51 rules in 4 ms. Remains 103 /130 variables (removed 27) and now considering 256/335 (removed 79) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/130 places, 256/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 107 transition count 289
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 107 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 99 transition count 246
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 99 transition count 246
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 94 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 94 transition count 226
Applied a total of 69 rules in 4 ms. Remains 94 /130 variables (removed 36) and now considering 226/335 (removed 109) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 94/130 places, 226/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 335/335 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 335
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 107 transition count 287
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 107 transition count 287
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 98 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 98 transition count 239
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 92 transition count 215
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 92 transition count 215
Applied a total of 74 rules in 4 ms. Remains 92 /130 variables (removed 38) and now considering 215/335 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 92/130 places, 215/335 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:24:41] [INFO ] Input system was already deterministic with 215 transitions.
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:24:41] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:24:41] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-02 19:24:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 335 transitions and 1733 arcs took 5 ms.
Total runtime 115498 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 : MedleyA-PT-11-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-11-CTLFireability-2024-14

BK_STOP 1717356282107

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

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

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

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