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.r488-tall-171631132900537.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 DoubleExponent-PT-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717193664188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:14:25] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-31 22:14:25] [INFO ] Transformed 163 places.
[2024-05-31 22:14:25] [INFO ] Transformed 148 transitions.
[2024-05-31 22:14:25] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 104 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 148
Applied a total of 2 rules in 43 ms. Remains 161 /163 variables (removed 2) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 161 cols
[2024-05-31 22:14:25] [INFO ] Computed 17 invariants in 20 ms
[2024-05-31 22:14:26] [INFO ] Implicit Places using invariants in 271 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/163 places, 148/148 transitions.
Applied a total of 0 rules in 18 ms. Remains 160 /160 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 160/163 places, 148/148 transitions.
Support contains 104 out of 160 places after structural reductions.
[2024-05-31 22:14:26] [INFO ] Flatten gal took : 53 ms
[2024-05-31 22:14:26] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:14:26] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1318 resets) in 1773 ms. (22 steps per ms) remains 65/94 properties
BEST_FIRST walk for 4000 steps (115 resets) in 180 ms. (22 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (108 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (113 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (107 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (104 resets) in 49 ms. (80 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (109 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (115 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (114 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (106 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (111 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (108 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (106 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (115 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (108 resets) in 51 ms. (76 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (119 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (117 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (115 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (114 resets) in 58 ms. (67 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (114 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (116 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (112 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 43 ms. (90 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (107 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (112 resets) in 62 ms. (63 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (120 resets) in 51 ms. (76 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (111 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (107 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (106 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (117 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (106 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (120 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (110 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (112 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (111 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (114 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (116 resets) in 45 ms. (86 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (115 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (112 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (115 resets) in 45 ms. (86 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (116 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (105 resets) in 22 ms. (173 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (110 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (116 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (108 resets) in 29 ms. (133 steps per ms) remains 65/65 properties
// Phase 1: matrix 148 rows 160 cols
[2024-05-31 22:14:27] [INFO ] Computed 16 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/153 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 53 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 4/9 constraints. Problems are: Problem set: 16 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 16 solved, 49 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 4 (OVERLAPS) 7/160 variables, 7/16 constraints. Problems are: Problem set: 18 solved, 47 unsolved
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 11 ms to minimize.
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:14:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:14:29] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:14:29] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:14:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:14:29] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 8/24 constraints. Problems are: Problem set: 19 solved, 46 unsolved
[2024-05-31 22:14:29] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/25 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/25 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 148/308 variables, 160/185 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/185 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/185 constraints. Problems are: Problem set: 19 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 185 constraints, problems are : Problem set: 19 solved, 46 unsolved in 2564 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 19 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 46 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 84/148 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 45 unsolved
Problem AtomicPropp64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 3/8 constraints. Problems are: Problem set: 21 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 2/10 constraints. Problems are: Problem set: 21 solved, 44 unsolved
[2024-05-31 22:14:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-31 22:14:30] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 2 ms to minimize.
[2024-05-31 22:14:30] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 2 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 95 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 3 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 91 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 7/17 constraints. Problems are: Problem set: 21 solved, 44 unsolved
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/18 constraints. Problems are: Problem set: 21 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 21 solved, 44 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 7 (OVERLAPS) 12/160 variables, 8/26 constraints. Problems are: Problem set: 22 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 7/33 constraints. Problems are: Problem set: 22 solved, 43 unsolved
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
[2024-05-31 22:14:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:14:32] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:14:32] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 5/38 constraints. Problems are: Problem set: 22 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/38 constraints. Problems are: Problem set: 22 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 148/308 variables, 160/198 constraints. Problems are: Problem set: 22 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 43/241 constraints. Problems are: Problem set: 22 solved, 43 unsolved
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 100 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/245 constraints. Problems are: Problem set: 22 solved, 43 unsolved
[2024-05-31 22:14:34] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 1/246 constraints. Problems are: Problem set: 22 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 246 constraints, problems are : Problem set: 22 solved, 43 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 43/65 constraints, Known Traps: 27/27 constraints]
After SMT, in 7638ms problems are : Problem set: 22 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 148/148 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 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 146
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 158 transition count 138
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 20 place count 150 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 150 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 145 transition count 133
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 135 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 134 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 134 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 133 transition count 122
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 59 place count 133 transition count 117
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 64 place count 128 transition count 117
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 70 place count 128 transition count 117
Applied a total of 70 rules in 61 ms. Remains 128 /160 variables (removed 32) and now considering 117/148 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 128/160 places, 117/148 transitions.
RANDOM walk for 40000 steps (2295 resets) in 540 ms. (73 steps per ms) remains 29/43 properties
BEST_FIRST walk for 4002 steps (181 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (177 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (182 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (187 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (184 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (161 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (185 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (184 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (189 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (193 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (183 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (194 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (187 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (180 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (203 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (185 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (177 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (183 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (182 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (189 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (185 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (180 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (185 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (190 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (181 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (180 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (213 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (183 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
// Phase 1: matrix 117 rows 128 cols
[2024-05-31 22:14:36] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 22:14:36] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 51/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 32/128 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 117/245 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 147 constraints, problems are : Problem set: 0 solved, 29 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 51/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 22:14:36] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 32/128 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 5 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 22:14:37] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 117/245 variables, 128/159 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 29/191 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:14:38] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 22:14:39] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:14:39] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/245 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 200 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 24/24 constraints]
After SMT, in 4381ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1975 ms.
Support contains 45 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 117/117 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 127 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 125 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 125 transition count 112
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 123 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 24 place count 116 transition count 105
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 116 transition count 100
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 34 place count 111 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 111 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 110 transition count 99
Applied a total of 36 rules in 23 ms. Remains 110 /128 variables (removed 18) and now considering 99/117 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 110/128 places, 99/117 transitions.
RANDOM walk for 40000 steps (3467 resets) in 261 ms. (152 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (256 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (260 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (256 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (251 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (244 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (253 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (204 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (268 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (257 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (263 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (240 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (245 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (263 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (238 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (251 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (296 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (251 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (252 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (249 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (265 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (251 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (260 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (271 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (254 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (258 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (256 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (255 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (300 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (252 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 885322 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :28 out of 29
Probabilistic random walk after 885322 steps, saw 442798 distinct states, run finished after 3005 ms. (steps per millisecond=294 ) properties seen :28
// Phase 1: matrix 99 rows 110 cols
[2024-05-31 22:14:45] [INFO ] Computed 16 invariants in 5 ms
[2024-05-31 22:14:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/74 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/108 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/208 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/209 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 110/110 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/74 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/108 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 4 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 99/208 variables, 109/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/209 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 110/110 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 99/99 transitions.
Graph (complete) has 245 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 106 transition count 89
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 98 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 97 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 97 transition count 86
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 24 place count 95 transition count 86
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 52 place count 81 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 80 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 80 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 78 transition count 70
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 69 place count 78 transition count 59
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 80 place count 67 transition count 59
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 85 place count 67 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 66 transition count 58
Applied a total of 86 rules in 40 ms. Remains 66 /110 variables (removed 44) and now considering 58/99 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 66/110 places, 58/99 transitions.
RANDOM walk for 40000 steps (5096 resets) in 574 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3308 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1585169 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :0 out of 1
Probabilistic random walk after 1585169 steps, saw 792654 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
// Phase 1: matrix 58 rows 66 cols
[2024-05-31 22:14:49] [INFO ] Computed 15 invariants in 9 ms
[2024-05-31 22:14:49] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/62 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/120 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/124 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/62 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/120 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:14:50] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/124 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 66/66 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-31 22:14:50] [INFO ] Invariant cache hit.
[2024-05-31 22:14:50] [INFO ] Implicit Places using invariants in 59 ms returned [14, 19, 33, 37, 57, 63]
[2024-05-31 22:14:50] [INFO ] Actually due to overlaps returned [37, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/66 places, 58/58 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 57
Applied a total of 2 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 63 cols
[2024-05-31 22:14:50] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 22:14:50] [INFO ] Implicit Places using invariants in 78 ms returned [14, 19, 54, 60]
[2024-05-31 22:14:50] [INFO ] Actually due to overlaps returned [14, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/66 places, 57/58 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 56
Applied a total of 3 rules in 8 ms. Remains 60 /61 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 60 cols
[2024-05-31 22:14:50] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:14:50] [INFO ] Implicit Places using invariants in 53 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 59/66 places, 56/58 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 55
Applied a total of 2 rules in 4 ms. Remains 58 /59 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 58 cols
[2024-05-31 22:14:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:14:50] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 22:14:50] [INFO ] Invariant cache hit.
[2024-05-31 22:14:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:14:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 58/66 places, 55/58 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 351 ms. Remains : 58/66 places, 55/58 transitions.
RANDOM walk for 40000 steps (5736 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Probably explored full state space saw : 710932 states, properties seen :0
Probabilistic random walk after 1421928 steps, saw 710932 distinct states, run finished after 2465 ms. (steps per millisecond=576 ) properties seen :0
Explored full state space saw : 713108 states, properties seen :0
Exhaustive walk after 1426215 steps, saw 713108 distinct states, run finished after 2395 ms. (steps per millisecond=595 ) properties seen :0
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-003-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:14:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 12 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 79 out of 160 places (down from 85) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 264 edges and 160 vertex of which 156 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Graph (complete) has 264 edges and 160 vertex of which 157 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 156 transition count 111
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 121 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 75 place count 119 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 114 transition count 104
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 131 place count 91 transition count 81
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 91 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 90 transition count 80
Applied a total of 134 rules in 25 ms. Remains 90 /160 variables (removed 70) and now considering 80/148 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 90/160 places, 80/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 6 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 6 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 7 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 159 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 158 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 158 transition count 147
Applied a total of 3 rules in 6 ms. Remains 158 /160 variables (removed 2) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 158/160 places, 147/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Graph (complete) has 264 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 158 transition count 119
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 130 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 127 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 63 place count 127 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 73 place count 122 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 106 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 106 transition count 95
Applied a total of 106 rules in 14 ms. Remains 106 /160 variables (removed 54) and now considering 95/148 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 106/160 places, 95/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Applied a total of 2 rules in 3 ms. Remains 158 /160 variables (removed 2) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/160 places, 148/148 transitions.
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:55] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:55] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 7 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 4 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 4 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 4 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:14:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 148 transitions and 412 arcs took 2 ms.
Total runtime 30872 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 : DoubleExponent-PT-003-CTLCardinality-2024-00
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-02
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-04
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-05
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-06
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-07
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-08
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2024-11
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2023-12
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2023-13
Could not compute solution for formula : DoubleExponent-PT-003-CTLCardinality-2023-14

BK_STOP 1717193696616

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

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

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

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