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-171734921300146.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-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717361964359

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-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:59:27] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-02 20:59:27] [INFO ] Transformed 272 places.
[2024-06-02 20:59:27] [INFO ] Transformed 586 transitions.
[2024-06-02 20:59:27] [INFO ] Found NUPN structural information;
[2024-06-02 20:59:27] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 3 transitions.
Support contains 96 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 63 place count 206 transition count 515
Iterating global reduction 1 with 61 rules applied. Total rules applied 124 place count 206 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 204 transition count 511
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 204 transition count 511
Applied a total of 128 rules in 95 ms. Remains 204 /269 variables (removed 65) and now considering 511/583 (removed 72) transitions.
// Phase 1: matrix 511 rows 204 cols
[2024-06-02 20:59:27] [INFO ] Computed 22 invariants in 22 ms
[2024-06-02 20:59:27] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-02 20:59:27] [INFO ] Invariant cache hit.
[2024-06-02 20:59:28] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-06-02 20:59:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/204 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-02 20:59:40] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 39 ms to minimize.
[2024-06-02 20:59:40] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 4 ms to minimize.
[2024-06-02 20:59:40] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 4 ms to minimize.
[2024-06-02 20:59:40] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-02 20:59:41] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-06-02 20:59:41] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:59:41] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:59:41] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 8 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:59:42] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 13 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:59:43] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 17/39 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-02 20:59:49] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:59:50] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:59:50] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/42 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-02 20:59:53] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/43 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/715 variables, and 44 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 120 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/204 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 22/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/44 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 511/715 variables, 204/248 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 390/638 constraints. Problems are: Problem set: 120 solved, 390 unsolved
[2024-06-02 21:00:16] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 4 ms to minimize.
[2024-06-02 21:00:16] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-02 21:00:16] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-06-02 21:00:17] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-06-02 21:00:17] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:00:19] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:00:20] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 4 ms to minimize.
[2024-06-02 21:00:21] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 3 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 49 places in 327 ms of which 3 ms to minimize.
[2024-06-02 21:00:22] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-06-02 21:00:23] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2024-06-02 21:00:24] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/715 variables, and 650 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 390/510 constraints, Known Traps: 34/34 constraints]
After SMT, in 62555ms problems are : Problem set: 120 solved, 390 unsolved
Search for dead transitions found 120 dead transitions in 62633ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/269 places, 391/583 transitions.
Applied a total of 0 rules in 13 ms. Remains 204 /204 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63836 ms. Remains : 204/269 places, 391/583 transitions.
Support contains 96 out of 204 places after structural reductions.
[2024-06-02 21:00:31] [INFO ] Flatten gal took : 148 ms
[2024-06-02 21:00:31] [INFO ] Flatten gal took : 70 ms
[2024-06-02 21:00:31] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 95 out of 204 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 3121 ms. (12 steps per ms) remains 56/83 properties
BEST_FIRST walk for 4004 steps (13 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (11 resets) in 45 ms. (87 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (12 resets) in 42 ms. (93 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (14 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (11 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (9 resets) in 51 ms. (77 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (11 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 32 ms. (121 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (13 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (11 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (10 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (11 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (10 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (9 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (14 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (13 resets) in 19 ms. (200 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
// Phase 1: matrix 391 rows 204 cols
[2024-06-02 21:00:33] [INFO ] Computed 22 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/131 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 46 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 3 (OVERLAPS) 60/191 variables, 16/22 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 381/572 variables, 191/213 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/213 constraints. Problems are: Problem set: 11 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 15/587 variables, 8/221 constraints. Problems are: Problem set: 11 solved, 39 unsolved
[2024-06-02 21:00:35] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 11 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 1/222 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/222 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 8/595 variables, 5/227 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 0/227 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/595 variables, 0/227 constraints. Problems are: Problem set: 12 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 227 constraints, problems are : Problem set: 12 solved, 38 unsolved in 3798 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 12 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 38 unsolved
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/127 variables, 6/6 constraints. Problems are: Problem set: 15 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 15 solved, 35 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 3 (OVERLAPS) 64/191 variables, 16/22 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/23 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:38] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/24 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:38] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:00:38] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:00:38] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/27 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:39] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/28 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:39] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/29 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:40] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:00:40] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/31 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 381/572 variables, 191/222 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 14/236 constraints. Problems are: Problem set: 17 solved, 33 unsolved
[2024-06-02 21:00:41] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 1/237 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/237 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 15/587 variables, 8/245 constraints. Problems are: Problem set: 17 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/595 variables, and 264 constraints, problems are : Problem set: 17 solved, 33 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 199/204 constraints, PredecessorRefiner: 33/50 constraints, Known Traps: 10/10 constraints]
After SMT, in 9034ms problems are : Problem set: 17 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 391/391 transitions.
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 202 transition count 371
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 185 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 184 transition count 370
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 38 place count 184 transition count 361
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 56 place count 175 transition count 361
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 71 place count 160 transition count 339
Iterating global reduction 3 with 15 rules applied. Total rules applied 86 place count 160 transition count 339
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 120 place count 143 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 140 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 140 transition count 333
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 140 transition count 331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 138 transition count 331
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 143 place count 138 transition count 324
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 150 place count 131 transition count 324
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 131 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 154 place count 129 transition count 322
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 169 place count 129 transition count 322
Applied a total of 169 rules in 259 ms. Remains 129 /204 variables (removed 75) and now considering 322/391 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 129/204 places, 322/391 transitions.
RANDOM walk for 40000 steps (14 resets) in 875 ms. (45 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4003 steps (24 resets) in 37 ms. (105 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (27 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (18 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (22 resets) in 28 ms. (137 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4002 steps (24 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (10 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (19 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (29 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 21 ms. (182 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (18 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (20 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (17 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
// Phase 1: matrix 322 rows 129 cols
[2024-06-02 21:00:43] [INFO ] Computed 23 invariants in 3 ms
[2024-06-02 21:00:43] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 33/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 51/128 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 322/450 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/451 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 161 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 129/129 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 33/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 51/128 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 322/450 variables, 128/151 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/451 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 15/183 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/451 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 183 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3982 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 129/129 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 5416ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 20 properties in 19699 ms.
Support contains 9 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 322/322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 129 transition count 316
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 123 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 122 transition count 315
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 122 transition count 312
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 119 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 116 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 116 transition count 309
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 58 place count 99 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 99 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 66 place count 96 transition count 300
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 73 place count 96 transition count 293
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 81 place count 89 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 89 transition count 291
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 94 place count 89 transition count 432
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 129 place count 77 transition count 409
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 131 place count 77 transition count 409
Applied a total of 131 rules in 123 ms. Remains 77 /129 variables (removed 52) and now considering 409/322 (removed -87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 77/129 places, 409/322 transitions.
RANDOM walk for 40000 steps (3902 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (574 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (772 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5337 steps, run visited all 2 properties in 85 ms. (steps per millisecond=62 )
Probabilistic random walk after 5337 steps, saw 1643 distinct states, run finished after 94 ms. (steps per millisecond=56 ) properties seen :2
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-19-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:01:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-19-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:01:09] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 77 out of 204 places (down from 86) after GAL structural reductions.
Computed a total of 21 stabilizing places and 22 stable transitions
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 188 transition count 373
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 188 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 371
Applied a total of 34 rules in 16 ms. Remains 187 /204 variables (removed 17) and now considering 371/391 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 187/204 places, 371/391 transitions.
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 42 ms
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 43 ms
[2024-06-02 21:01:09] [INFO ] Input system was already deterministic with 371 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 38 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:01:09] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 9 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:01:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:01:09] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 203 transition count 363
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 176 transition count 359
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 174 transition count 358
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 173 transition count 357
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 63 place count 173 transition count 351
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 75 place count 167 transition count 351
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 92 place count 150 transition count 327
Iterating global reduction 4 with 17 rules applied. Total rules applied 109 place count 150 transition count 327
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 149 transition count 325
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 149 transition count 325
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 37 rules applied. Total rules applied 148 place count 130 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 130 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 128 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 127 transition count 302
Applied a total of 155 rules in 66 ms. Remains 127 /204 variables (removed 77) and now considering 302/391 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 127/204 places, 302/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 188 transition count 370
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 188 transition count 370
Applied a total of 32 rules in 6 ms. Remains 188 /204 variables (removed 16) and now considering 370/391 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 188/204 places, 370/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 8 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 10 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 10 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 10 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 185 transition count 367
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 365
Applied a total of 40 rules in 39 ms. Remains 184 /204 variables (removed 20) and now considering 365/391 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 184/204 places, 365/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 9 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 8 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:01:10] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 186 transition count 368
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 366
Applied a total of 38 rules in 9 ms. Remains 185 /204 variables (removed 19) and now considering 366/391 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 185/204 places, 366/391 transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:11] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 204/204 places, 391/391 transitions.
Graph (complete) has 703 edges and 204 vertex of which 202 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 201 transition count 356
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 169 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 167 transition count 352
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 71 place count 167 transition count 343
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 89 place count 158 transition count 343
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 108 place count 139 transition count 316
Iterating global reduction 3 with 19 rules applied. Total rules applied 127 place count 139 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 139 transition count 314
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 137 transition count 314
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 184 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 108 transition count 287
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 108 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 190 place count 108 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 108 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 107 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 198 place count 104 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 104 transition count 279
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 103 transition count 278
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 103 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 101 transition count 276
Applied a total of 203 rules in 65 ms. Remains 101 /204 variables (removed 103) and now considering 276/391 (removed 115) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 101/204 places, 276/391 transitions.
[2024-06-02 21:01:11] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:01:11] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:01:11] [INFO ] Input system was already deterministic with 276 transitions.
RANDOM walk for 40000 steps (3144 resets) in 390 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (379 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1067 steps, run visited all 1 properties in 8 ms. (steps per millisecond=133 )
Probabilistic random walk after 1067 steps, saw 452 distinct states, run finished after 8 ms. (steps per millisecond=133 ) properties seen :1
FORMULA MedleyA-PT-19-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 21:01:11] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:01:11] [INFO ] Flatten gal took : 18 ms
[2024-06-02 21:01:11] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 21:01:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 204 places, 391 transitions and 1809 arcs took 5 ms.
Total runtime 104736 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-19-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-19-CTLFireability-2024-13

BK_STOP 1717362071971

--------------------
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-19-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/671/ctl_0_
ctl formula name MedleyA-PT-19-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/671/ctl_1_
ctl formula name MedleyA-PT-19-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/671/ctl_2_
ctl formula name MedleyA-PT-19-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/671/ctl_3_
ctl formula name MedleyA-PT-19-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/671/ctl_4_
ctl formula name MedleyA-PT-19-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/671/ctl_5_
ctl formula name MedleyA-PT-19-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/671/ctl_6_
ctl formula name MedleyA-PT-19-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/671/ctl_7_
ctl formula name MedleyA-PT-19-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/671/ctl_8_
ctl formula name MedleyA-PT-19-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/671/ctl_9_
ctl formula name MedleyA-PT-19-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/671/ctl_10_
ctl formula name MedleyA-PT-19-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/671/ctl_11_
ctl formula name MedleyA-PT-19-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/671/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
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-19, 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-171734921300146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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