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.r464-smll-171620118400354.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 Anderson-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717257408971

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:56:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:56:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:56:51] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2024-06-01 15:56:51] [INFO ] Transformed 505 places.
[2024-06-01 15:56:51] [INFO ] Transformed 1845 transitions.
[2024-06-01 15:56:51] [INFO ] Found NUPN structural information;
[2024-06-01 15:56:51] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 130 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 436 transition count 1632
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 436 transition count 1632
Applied a total of 138 rules in 142 ms. Remains 436 /505 variables (removed 69) and now considering 1632/1845 (removed 213) transitions.
// Phase 1: matrix 1632 rows 436 cols
[2024-06-01 15:56:52] [INFO ] Computed 21 invariants in 62 ms
[2024-06-01 15:56:52] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-06-01 15:56:52] [INFO ] Invariant cache hit.
[2024-06-01 15:56:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:56:56] [INFO ] Implicit Places using invariants and state equation in 3428 ms returned []
Implicit Place search using SMT with State Equation took 4224 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-06-01 15:56:56] [INFO ] Invariant cache hit.
[2024-06-01 15:56:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
[2024-06-01 15:57:28] [INFO ] Deduced a trap composed of 122 places in 830 ms of which 72 ms to minimize.
[2024-06-01 15:57:28] [INFO ] Deduced a trap composed of 122 places in 658 ms of which 6 ms to minimize.
[2024-06-01 15:57:29] [INFO ] Deduced a trap composed of 104 places in 491 ms of which 5 ms to minimize.
[2024-06-01 15:57:30] [INFO ] Deduced a trap composed of 90 places in 657 ms of which 10 ms to minimize.
[2024-06-01 15:57:31] [INFO ] Deduced a trap composed of 152 places in 1011 ms of which 13 ms to minimize.
[2024-06-01 15:57:31] [INFO ] Deduced a trap composed of 232 places in 692 ms of which 7 ms to minimize.
[2024-06-01 15:57:32] [INFO ] Deduced a trap composed of 107 places in 787 ms of which 7 ms to minimize.
SMT process timed out in 36113ms, After SMT, problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 36211ms
Starting structural reductions in LTL mode, iteration 1 : 436/505 places, 1632/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40631 ms. Remains : 436/505 places, 1632/1845 transitions.
Support contains 130 out of 436 places after structural reductions.
[2024-06-01 15:57:33] [INFO ] Flatten gal took : 379 ms
[2024-06-01 15:57:33] [INFO ] Flatten gal took : 198 ms
[2024-06-01 15:57:33] [INFO ] Input system was already deterministic with 1632 transitions.
Support contains 128 out of 436 places (down from 130) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4939 ms. (8 steps per ms) remains 66/120 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 58/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
[2024-06-01 15:57:36] [INFO ] Invariant cache hit.
[2024-06-01 15:57:36] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp87 is UNSAT
At refinement iteration 1 (OVERLAPS) 373/432 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 5/15 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp116 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/436 variables, 6/21 constraints. Problems are: Problem set: 6 solved, 29 unsolved
[2024-06-01 15:57:38] [INFO ] Deduced a trap composed of 110 places in 584 ms of which 6 ms to minimize.
[2024-06-01 15:57:38] [INFO ] Deduced a trap composed of 144 places in 443 ms of which 5 ms to minimize.
[2024-06-01 15:57:39] [INFO ] Deduced a trap composed of 137 places in 518 ms of which 5 ms to minimize.
[2024-06-01 15:57:39] [INFO ] Deduced a trap composed of 105 places in 454 ms of which 5 ms to minimize.
[2024-06-01 15:57:40] [INFO ] Deduced a trap composed of 221 places in 502 ms of which 5 ms to minimize.
[2024-06-01 15:57:41] [INFO ] Deduced a trap composed of 229 places in 620 ms of which 6 ms to minimize.
[2024-06-01 15:57:41] [INFO ] Deduced a trap composed of 122 places in 759 ms of which 7 ms to minimize.
SMT process timed out in 5848ms, After SMT, problems are : Problem set: 6 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 68 Pre rules applied. Total rules applied 0 place count 436 transition count 1564
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 368 transition count 1564
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 181 place count 323 transition count 943
Iterating global reduction 0 with 45 rules applied. Total rules applied 226 place count 323 transition count 943
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 232 place count 320 transition count 940
Applied a total of 232 rules in 239 ms. Remains 320 /436 variables (removed 116) and now considering 940/1632 (removed 692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 320/436 places, 940/1632 transitions.
RANDOM walk for 40000 steps (8 resets) in 1254 ms. (31 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
// Phase 1: matrix 940 rows 320 cols
[2024-06-01 15:57:42] [INFO ] Computed 21 invariants in 18 ms
[2024-06-01 15:57:42] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 274/311 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 9/320 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 15:57:43] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:57:43] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:57:44] [INFO ] Deduced a trap composed of 114 places in 406 ms of which 5 ms to minimize.
[2024-06-01 15:57:44] [INFO ] Deduced a trap composed of 195 places in 378 ms of which 5 ms to minimize.
[2024-06-01 15:57:45] [INFO ] Deduced a trap composed of 92 places in 403 ms of which 5 ms to minimize.
[2024-06-01 15:57:45] [INFO ] Deduced a trap composed of 193 places in 426 ms of which 6 ms to minimize.
[2024-06-01 15:57:46] [INFO ] Deduced a trap composed of 105 places in 428 ms of which 6 ms to minimize.
[2024-06-01 15:57:46] [INFO ] Deduced a trap composed of 179 places in 527 ms of which 6 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 124 places in 437 ms of which 5 ms to minimize.
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 204 places in 530 ms of which 5 ms to minimize.
[2024-06-01 15:57:48] [INFO ] Deduced a trap composed of 86 places in 441 ms of which 6 ms to minimize.
[2024-06-01 15:57:48] [INFO ] Deduced a trap composed of 96 places in 524 ms of which 5 ms to minimize.
[2024-06-01 15:57:49] [INFO ] Deduced a trap composed of 85 places in 504 ms of which 6 ms to minimize.
[2024-06-01 15:57:49] [INFO ] Deduced a trap composed of 71 places in 548 ms of which 5 ms to minimize.
[2024-06-01 15:57:50] [INFO ] Deduced a trap composed of 101 places in 466 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 15:57:51] [INFO ] Deduced a trap composed of 119 places in 488 ms of which 5 ms to minimize.
[2024-06-01 15:57:51] [INFO ] Deduced a trap composed of 109 places in 425 ms of which 5 ms to minimize.
[2024-06-01 15:57:52] [INFO ] Deduced a trap composed of 118 places in 463 ms of which 5 ms to minimize.
[2024-06-01 15:57:52] [INFO ] Deduced a trap composed of 168 places in 507 ms of which 6 ms to minimize.
[2024-06-01 15:57:53] [INFO ] Deduced a trap composed of 90 places in 511 ms of which 6 ms to minimize.
[2024-06-01 15:57:53] [INFO ] Deduced a trap composed of 208 places in 541 ms of which 5 ms to minimize.
[2024-06-01 15:57:54] [INFO ] Deduced a trap composed of 207 places in 535 ms of which 6 ms to minimize.
[2024-06-01 15:57:54] [INFO ] Deduced a trap composed of 136 places in 465 ms of which 5 ms to minimize.
[2024-06-01 15:57:55] [INFO ] Deduced a trap composed of 115 places in 475 ms of which 5 ms to minimize.
[2024-06-01 15:57:56] [INFO ] Deduced a trap composed of 130 places in 552 ms of which 6 ms to minimize.
[2024-06-01 15:57:56] [INFO ] Deduced a trap composed of 126 places in 522 ms of which 6 ms to minimize.
[2024-06-01 15:57:57] [INFO ] Deduced a trap composed of 175 places in 509 ms of which 6 ms to minimize.
[2024-06-01 15:57:57] [INFO ] Deduced a trap composed of 161 places in 491 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 15:57:58] [INFO ] Deduced a trap composed of 190 places in 505 ms of which 6 ms to minimize.
[2024-06-01 15:57:59] [INFO ] Deduced a trap composed of 190 places in 533 ms of which 5 ms to minimize.
[2024-06-01 15:57:59] [INFO ] Deduced a trap composed of 117 places in 488 ms of which 5 ms to minimize.
[2024-06-01 15:58:00] [INFO ] Deduced a trap composed of 84 places in 524 ms of which 4 ms to minimize.
[2024-06-01 15:58:00] [INFO ] Deduced a trap composed of 156 places in 561 ms of which 4 ms to minimize.
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 102 places in 383 ms of which 4 ms to minimize.
[2024-06-01 15:58:01] [INFO ] Deduced a trap composed of 170 places in 394 ms of which 5 ms to minimize.
[2024-06-01 15:58:02] [INFO ] Deduced a trap composed of 97 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:58:02] [INFO ] Deduced a trap composed of 127 places in 411 ms of which 6 ms to minimize.
[2024-06-01 15:58:02] [INFO ] Deduced a trap composed of 136 places in 496 ms of which 4 ms to minimize.
[2024-06-01 15:58:03] [INFO ] Deduced a trap composed of 139 places in 546 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 15:58:04] [INFO ] Deduced a trap composed of 115 places in 545 ms of which 5 ms to minimize.
[2024-06-01 15:58:05] [INFO ] Deduced a trap composed of 123 places in 526 ms of which 6 ms to minimize.
[2024-06-01 15:58:05] [INFO ] Deduced a trap composed of 98 places in 452 ms of which 5 ms to minimize.
[2024-06-01 15:58:06] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 8 ms to minimize.
[2024-06-01 15:58:06] [INFO ] Deduced a trap composed of 109 places in 387 ms of which 5 ms to minimize.
[2024-06-01 15:58:07] [INFO ] Deduced a trap composed of 64 places in 470 ms of which 13 ms to minimize.
[2024-06-01 15:58:07] [INFO ] Deduced a trap composed of 185 places in 432 ms of which 6 ms to minimize.
[2024-06-01 15:58:08] [INFO ] Deduced a trap composed of 182 places in 416 ms of which 3 ms to minimize.
[2024-06-01 15:58:08] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 3 ms to minimize.
[2024-06-01 15:58:08] [INFO ] Deduced a trap composed of 58 places in 368 ms of which 4 ms to minimize.
[2024-06-01 15:58:09] [INFO ] Deduced a trap composed of 180 places in 437 ms of which 5 ms to minimize.
[2024-06-01 15:58:09] [INFO ] Deduced a trap composed of 141 places in 528 ms of which 6 ms to minimize.
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 113 places in 497 ms of which 5 ms to minimize.
[2024-06-01 15:58:10] [INFO ] Deduced a trap composed of 102 places in 458 ms of which 5 ms to minimize.
[2024-06-01 15:58:11] [INFO ] Deduced a trap composed of 79 places in 440 ms of which 5 ms to minimize.
[2024-06-01 15:58:11] [INFO ] Deduced a trap composed of 148 places in 378 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 940/1260 variables, 320/396 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1260 variables, 72/468 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1260 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/1260 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 468 constraints, problems are : Problem set: 0 solved, 20 unsolved in 36732 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 320/320 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 274/311 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 4 (OVERLAPS) 9/320 variables, 9/21 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 55/76 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 15:58:20] [INFO ] Deduced a trap composed of 83 places in 276 ms of which 4 ms to minimize.
[2024-06-01 15:58:20] [INFO ] Deduced a trap composed of 77 places in 284 ms of which 4 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 94 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:58:21] [INFO ] Deduced a trap composed of 149 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:58:22] [INFO ] Deduced a trap composed of 92 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:58:22] [INFO ] Deduced a trap composed of 175 places in 493 ms of which 4 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 122 places in 493 ms of which 5 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:58:23] [INFO ] Deduced a trap composed of 124 places in 314 ms of which 6 ms to minimize.
[2024-06-01 15:58:24] [INFO ] Deduced a trap composed of 111 places in 474 ms of which 5 ms to minimize.
[2024-06-01 15:58:24] [INFO ] Deduced a trap composed of 93 places in 466 ms of which 5 ms to minimize.
[2024-06-01 15:58:25] [INFO ] Deduced a trap composed of 119 places in 485 ms of which 5 ms to minimize.
[2024-06-01 15:58:25] [INFO ] Deduced a trap composed of 130 places in 476 ms of which 5 ms to minimize.
[2024-06-01 15:58:26] [INFO ] Deduced a trap composed of 48 places in 491 ms of which 5 ms to minimize.
[2024-06-01 15:58:27] [INFO ] Deduced a trap composed of 91 places in 499 ms of which 6 ms to minimize.
[2024-06-01 15:58:27] [INFO ] Deduced a trap composed of 141 places in 434 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 16/92 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 15:58:29] [INFO ] Deduced a trap composed of 92 places in 282 ms of which 5 ms to minimize.
[2024-06-01 15:58:29] [INFO ] Deduced a trap composed of 74 places in 531 ms of which 5 ms to minimize.
[2024-06-01 15:58:30] [INFO ] Deduced a trap composed of 156 places in 425 ms of which 6 ms to minimize.
[2024-06-01 15:58:31] [INFO ] Deduced a trap composed of 147 places in 500 ms of which 5 ms to minimize.
[2024-06-01 15:58:31] [INFO ] Deduced a trap composed of 114 places in 498 ms of which 5 ms to minimize.
[2024-06-01 15:58:31] [INFO ] Deduced a trap composed of 97 places in 406 ms of which 5 ms to minimize.
[2024-06-01 15:58:32] [INFO ] Deduced a trap composed of 83 places in 391 ms of which 5 ms to minimize.
[2024-06-01 15:58:32] [INFO ] Deduced a trap composed of 177 places in 462 ms of which 5 ms to minimize.
[2024-06-01 15:58:33] [INFO ] Deduced a trap composed of 110 places in 502 ms of which 5 ms to minimize.
[2024-06-01 15:58:33] [INFO ] Deduced a trap composed of 85 places in 486 ms of which 5 ms to minimize.
[2024-06-01 15:58:34] [INFO ] Deduced a trap composed of 212 places in 505 ms of which 5 ms to minimize.
[2024-06-01 15:58:34] [INFO ] Deduced a trap composed of 143 places in 489 ms of which 5 ms to minimize.
[2024-06-01 15:58:35] [INFO ] Deduced a trap composed of 192 places in 516 ms of which 6 ms to minimize.
[2024-06-01 15:58:35] [INFO ] Deduced a trap composed of 132 places in 498 ms of which 5 ms to minimize.
[2024-06-01 15:58:36] [INFO ] Deduced a trap composed of 120 places in 483 ms of which 5 ms to minimize.
[2024-06-01 15:58:36] [INFO ] Deduced a trap composed of 115 places in 471 ms of which 5 ms to minimize.
[2024-06-01 15:58:37] [INFO ] Deduced a trap composed of 161 places in 500 ms of which 6 ms to minimize.
[2024-06-01 15:58:38] [INFO ] Deduced a trap composed of 107 places in 485 ms of which 5 ms to minimize.
[2024-06-01 15:58:38] [INFO ] Deduced a trap composed of 137 places in 491 ms of which 6 ms to minimize.
[2024-06-01 15:58:39] [INFO ] Deduced a trap composed of 116 places in 472 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/112 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 15:58:41] [INFO ] Deduced a trap composed of 66 places in 384 ms of which 3 ms to minimize.
[2024-06-01 15:58:41] [INFO ] Deduced a trap composed of 54 places in 457 ms of which 6 ms to minimize.
[2024-06-01 15:58:42] [INFO ] Deduced a trap composed of 172 places in 455 ms of which 6 ms to minimize.
[2024-06-01 15:58:42] [INFO ] Deduced a trap composed of 108 places in 345 ms of which 3 ms to minimize.
[2024-06-01 15:58:43] [INFO ] Deduced a trap composed of 131 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:58:43] [INFO ] Deduced a trap composed of 101 places in 476 ms of which 5 ms to minimize.
[2024-06-01 15:58:44] [INFO ] Deduced a trap composed of 75 places in 475 ms of which 5 ms to minimize.
[2024-06-01 15:58:44] [INFO ] Deduced a trap composed of 62 places in 484 ms of which 5 ms to minimize.
[2024-06-01 15:58:45] [INFO ] Deduced a trap composed of 122 places in 495 ms of which 5 ms to minimize.
[2024-06-01 15:58:45] [INFO ] Deduced a trap composed of 151 places in 488 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 10/122 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 146 places in 485 ms of which 5 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 181 places in 508 ms of which 5 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 132 places in 496 ms of which 6 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 94 places in 477 ms of which 5 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 177 places in 523 ms of which 5 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 169 places in 514 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 6/128 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 129 places in 404 ms of which 6 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 101 places in 449 ms of which 6 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 97 places in 519 ms of which 6 ms to minimize.
[2024-06-01 15:58:55] [INFO ] Deduced a trap composed of 80 places in 491 ms of which 5 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 133 places in 443 ms of which 5 ms to minimize.
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 164 places in 470 ms of which 5 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 147 places in 406 ms of which 5 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 64 places in 512 ms of which 5 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 129 places in 532 ms of which 6 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 101 places in 495 ms of which 5 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 172 places in 461 ms of which 5 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 67 places in 476 ms of which 6 ms to minimize.
[2024-06-01 15:59:02] [INFO ] Deduced a trap composed of 76 places in 468 ms of which 5 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 107 places in 438 ms of which 5 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 136 places in 464 ms of which 5 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 127 places in 472 ms of which 5 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 104 places in 486 ms of which 5 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 123 places in 454 ms of which 4 ms to minimize.
SMT process timed out in 82222ms, After SMT, problems are : Problem set: 1 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 940/940 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 804
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 804
Applied a total of 16 rules in 77 ms. Remains 312 /320 variables (removed 8) and now considering 804/940 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 312/320 places, 804/940 transitions.
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
// Phase 1: matrix 804 rows 312 cols
[2024-06-01 15:59:05] [INFO ] Computed 21 invariants in 17 ms
[2024-06-01 15:59:05] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 264/292 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/301 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 11/312 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 116 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 131 places in 389 ms of which 5 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 57 places in 511 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 82 places in 461 ms of which 6 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 127 places in 465 ms of which 5 ms to minimize.
[2024-06-01 15:59:09] [INFO ] Deduced a trap composed of 48 places in 449 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 138 places in 421 ms of which 5 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 86 places in 467 ms of which 5 ms to minimize.
[2024-06-01 15:59:10] [INFO ] Deduced a trap composed of 176 places in 434 ms of which 5 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 133 places in 450 ms of which 5 ms to minimize.
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 150 places in 441 ms of which 5 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 137 places in 400 ms of which 5 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 88 places in 439 ms of which 5 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 112 places in 527 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:14] [INFO ] Deduced a trap composed of 91 places in 477 ms of which 5 ms to minimize.
[2024-06-01 15:59:14] [INFO ] Deduced a trap composed of 167 places in 475 ms of which 5 ms to minimize.
[2024-06-01 15:59:15] [INFO ] Deduced a trap composed of 104 places in 474 ms of which 5 ms to minimize.
[2024-06-01 15:59:15] [INFO ] Deduced a trap composed of 167 places in 485 ms of which 6 ms to minimize.
[2024-06-01 15:59:16] [INFO ] Deduced a trap composed of 178 places in 462 ms of which 5 ms to minimize.
[2024-06-01 15:59:16] [INFO ] Deduced a trap composed of 179 places in 458 ms of which 5 ms to minimize.
[2024-06-01 15:59:17] [INFO ] Deduced a trap composed of 167 places in 478 ms of which 5 ms to minimize.
[2024-06-01 15:59:17] [INFO ] Deduced a trap composed of 120 places in 470 ms of which 6 ms to minimize.
[2024-06-01 15:59:18] [INFO ] Deduced a trap composed of 89 places in 419 ms of which 5 ms to minimize.
[2024-06-01 15:59:18] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-06-01 15:59:18] [INFO ] Deduced a trap composed of 134 places in 427 ms of which 6 ms to minimize.
[2024-06-01 15:59:19] [INFO ] Deduced a trap composed of 70 places in 446 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 60 places in 432 ms of which 5 ms to minimize.
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 58 places in 442 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 804/1116 variables, 312/361 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 72/433 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/1116 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 433 constraints, problems are : Problem set: 0 solved, 16 unsolved in 18767 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 264/292 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 9/301 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 11/312 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:25] [INFO ] Deduced a trap composed of 100 places in 494 ms of which 6 ms to minimize.
[2024-06-01 15:59:26] [INFO ] Deduced a trap composed of 100 places in 454 ms of which 6 ms to minimize.
[2024-06-01 15:59:26] [INFO ] Deduced a trap composed of 133 places in 453 ms of which 5 ms to minimize.
[2024-06-01 15:59:27] [INFO ] Deduced a trap composed of 101 places in 390 ms of which 5 ms to minimize.
[2024-06-01 15:59:27] [INFO ] Deduced a trap composed of 71 places in 454 ms of which 5 ms to minimize.
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 189 places in 452 ms of which 5 ms to minimize.
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 120 places in 449 ms of which 5 ms to minimize.
[2024-06-01 15:59:29] [INFO ] Deduced a trap composed of 121 places in 435 ms of which 5 ms to minimize.
[2024-06-01 15:59:29] [INFO ] Deduced a trap composed of 156 places in 430 ms of which 5 ms to minimize.
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 132 places in 439 ms of which 6 ms to minimize.
[2024-06-01 15:59:30] [INFO ] Deduced a trap composed of 90 places in 462 ms of which 6 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 125 places in 446 ms of which 5 ms to minimize.
[2024-06-01 15:59:31] [INFO ] Deduced a trap composed of 131 places in 432 ms of which 5 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 131 places in 424 ms of which 5 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 166 places in 460 ms of which 5 ms to minimize.
[2024-06-01 15:59:32] [INFO ] Deduced a trap composed of 132 places in 427 ms of which 5 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 141 places in 400 ms of which 5 ms to minimize.
[2024-06-01 15:59:33] [INFO ] Deduced a trap composed of 101 places in 455 ms of which 5 ms to minimize.
[2024-06-01 15:59:34] [INFO ] Deduced a trap composed of 138 places in 466 ms of which 5 ms to minimize.
[2024-06-01 15:59:34] [INFO ] Deduced a trap composed of 137 places in 440 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:35] [INFO ] Deduced a trap composed of 115 places in 492 ms of which 5 ms to minimize.
[2024-06-01 15:59:36] [INFO ] Deduced a trap composed of 139 places in 473 ms of which 5 ms to minimize.
[2024-06-01 15:59:36] [INFO ] Deduced a trap composed of 118 places in 457 ms of which 5 ms to minimize.
[2024-06-01 15:59:37] [INFO ] Deduced a trap composed of 108 places in 472 ms of which 5 ms to minimize.
[2024-06-01 15:59:37] [INFO ] Deduced a trap composed of 105 places in 445 ms of which 5 ms to minimize.
[2024-06-01 15:59:38] [INFO ] Deduced a trap composed of 99 places in 450 ms of which 5 ms to minimize.
[2024-06-01 15:59:38] [INFO ] Deduced a trap composed of 134 places in 485 ms of which 5 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 59 places in 409 ms of which 6 ms to minimize.
[2024-06-01 15:59:39] [INFO ] Deduced a trap composed of 158 places in 472 ms of which 5 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 207 places in 461 ms of which 5 ms to minimize.
[2024-06-01 15:59:40] [INFO ] Deduced a trap composed of 162 places in 462 ms of which 5 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 211 places in 450 ms of which 5 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 201 places in 442 ms of which 5 ms to minimize.
[2024-06-01 15:59:42] [INFO ] Deduced a trap composed of 180 places in 429 ms of which 5 ms to minimize.
[2024-06-01 15:59:42] [INFO ] Deduced a trap composed of 160 places in 444 ms of which 5 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 174 places in 454 ms of which 5 ms to minimize.
[2024-06-01 15:59:43] [INFO ] Deduced a trap composed of 179 places in 442 ms of which 5 ms to minimize.
[2024-06-01 15:59:44] [INFO ] Deduced a trap composed of 128 places in 455 ms of which 5 ms to minimize.
[2024-06-01 15:59:44] [INFO ] Deduced a trap composed of 133 places in 442 ms of which 5 ms to minimize.
[2024-06-01 15:59:44] [INFO ] Deduced a trap composed of 108 places in 368 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:46] [INFO ] Deduced a trap composed of 150 places in 397 ms of which 5 ms to minimize.
[2024-06-01 15:59:46] [INFO ] Deduced a trap composed of 97 places in 452 ms of which 5 ms to minimize.
[2024-06-01 15:59:47] [INFO ] Deduced a trap composed of 57 places in 415 ms of which 5 ms to minimize.
[2024-06-01 15:59:47] [INFO ] Deduced a trap composed of 62 places in 436 ms of which 5 ms to minimize.
[2024-06-01 15:59:47] [INFO ] Deduced a trap composed of 109 places in 411 ms of which 5 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 136 places in 445 ms of which 5 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 125 places in 453 ms of which 5 ms to minimize.
[2024-06-01 15:59:49] [INFO ] Deduced a trap composed of 156 places in 455 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 133 places in 415 ms of which 5 ms to minimize.
[2024-06-01 15:59:51] [INFO ] Deduced a trap composed of 142 places in 479 ms of which 6 ms to minimize.
[2024-06-01 15:59:52] [INFO ] Deduced a trap composed of 112 places in 509 ms of which 6 ms to minimize.
[2024-06-01 15:59:52] [INFO ] Deduced a trap composed of 136 places in 468 ms of which 5 ms to minimize.
[2024-06-01 15:59:53] [INFO ] Deduced a trap composed of 101 places in 435 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 804/1116 variables, 312/414 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 72/486 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/1116 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1116 variables, and 502 constraints, problems are : Problem set: 0 solved, 16 unsolved in 56589 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 81/81 constraints]
After SMT, in 75425ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 5 properties in 32387 ms.
Support contains 22 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 804/804 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 312 transition count 803
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 803
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 304 transition count 684
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 304 transition count 684
Applied a total of 16 rules in 47 ms. Remains 304 /312 variables (removed 8) and now considering 684/804 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 304/312 places, 684/804 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-09-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:00:53] [INFO ] Flatten gal took : 87 ms
[2024-06-01 16:00:53] [INFO ] Flatten gal took : 91 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 436 transition count 1560
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 364 transition count 1560
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 218 place count 290 transition count 494
Iterating global reduction 0 with 74 rules applied. Total rules applied 292 place count 290 transition count 494
Applied a total of 292 rules in 50 ms. Remains 290 /436 variables (removed 146) and now considering 494/1632 (removed 1138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 290/436 places, 494/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 494 transitions.
RANDOM walk for 40000 steps (8 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6208 steps (0 resets) in 18 ms. (326 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 362 transition count 566
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 362 transition count 566
Applied a total of 148 rules in 16 ms. Remains 362 /436 variables (removed 74) and now considering 566/1632 (removed 1066) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 362/436 places, 566/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 566 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 379 transition count 855
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 379 transition count 855
Applied a total of 114 rules in 17 ms. Remains 379 /436 variables (removed 57) and now considering 855/1632 (removed 777) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 379/436 places, 855/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 855 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 370 transition count 670
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 370 transition count 670
Applied a total of 132 rules in 15 ms. Remains 370 /436 variables (removed 66) and now considering 670/1632 (removed 962) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 370/436 places, 670/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 366 transition count 634
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 366 transition count 634
Applied a total of 140 rules in 16 ms. Remains 366 /436 variables (removed 70) and now considering 634/1632 (removed 998) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 366/436 places, 634/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:00:54] [INFO ] Input system was already deterministic with 634 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 374 transition count 722
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 374 transition count 722
Applied a total of 124 rules in 15 ms. Remains 374 /436 variables (removed 62) and now considering 722/1632 (removed 910) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 374/436 places, 722/1632 transitions.
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:00:54] [INFO ] Flatten gal took : 40 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 722 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 362 transition count 550
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 362 transition count 550
Applied a total of 148 rules in 18 ms. Remains 362 /436 variables (removed 74) and now considering 550/1632 (removed 1082) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 362/436 places, 550/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 550 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 436 transition count 1560
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 364 transition count 1560
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 218 place count 290 transition count 494
Iterating global reduction 0 with 74 rules applied. Total rules applied 292 place count 290 transition count 494
Applied a total of 292 rules in 55 ms. Remains 290 /436 variables (removed 146) and now considering 494/1632 (removed 1138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 290/436 places, 494/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 494 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 436 transition count 1561
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 365 transition count 1561
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 210 place count 297 transition count 581
Iterating global reduction 0 with 68 rules applied. Total rules applied 278 place count 297 transition count 581
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 280 place count 296 transition count 580
Applied a total of 280 rules in 59 ms. Remains 296 /436 variables (removed 140) and now considering 580/1632 (removed 1052) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 296/436 places, 580/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 373 transition count 753
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 373 transition count 753
Applied a total of 126 rules in 28 ms. Remains 373 /436 variables (removed 63) and now considering 753/1632 (removed 879) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 373/436 places, 753/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 753 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 368 transition count 668
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 368 transition count 668
Applied a total of 136 rules in 63 ms. Remains 368 /436 variables (removed 68) and now considering 668/1632 (removed 964) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 368/436 places, 668/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 668 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 70 Pre rules applied. Total rules applied 0 place count 436 transition count 1562
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 0 with 140 rules applied. Total rules applied 140 place count 366 transition count 1562
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 205 place count 301 transition count 617
Iterating global reduction 0 with 65 rules applied. Total rules applied 270 place count 301 transition count 617
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 0 with 4 rules applied. Total rules applied 274 place count 299 transition count 615
Applied a total of 274 rules in 54 ms. Remains 299 /436 variables (removed 137) and now considering 615/1632 (removed 1017) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 299/436 places, 615/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:00:55] [INFO ] Input system was already deterministic with 615 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 366 transition count 618
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 366 transition count 618
Applied a total of 140 rules in 27 ms. Remains 366 /436 variables (removed 70) and now considering 618/1632 (removed 1014) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 366/436 places, 618/1632 transitions.
[2024-06-01 16:00:55] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:00:56] [INFO ] Input system was already deterministic with 618 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 373 transition count 721
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 373 transition count 721
Applied a total of 126 rules in 23 ms. Remains 373 /436 variables (removed 63) and now considering 721/1632 (removed 911) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 373/436 places, 721/1632 transitions.
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:00:56] [INFO ] Input system was already deterministic with 721 transitions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1632/1632 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 365 transition count 617
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 365 transition count 617
Applied a total of 142 rules in 22 ms. Remains 365 /436 variables (removed 71) and now considering 617/1632 (removed 1015) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 365/436 places, 617/1632 transitions.
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:00:56] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:00:56] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:00:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 16:00:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 436 places, 1632 transitions and 6360 arcs took 13 ms.
Total runtime 245207 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 : Anderson-PT-09-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-06
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2024-11
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-09-CTLFireability-2023-14

BK_STOP 1717257657045

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

Sequence of Actions to be Executed by the VM

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

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

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