Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717354520235

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:55:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:55:23] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-06-02 18:55:23] [INFO ] Transformed 147 places.
[2024-06-02 18:55:23] [INFO ] Transformed 315 transitions.
[2024-06-02 18:55:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:55:23] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 2 transitions.
Support contains 84 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 127 transition count 297
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 127 transition count 297
Applied a total of 34 rules in 68 ms. Remains 127 /145 variables (removed 18) and now considering 297/313 (removed 16) transitions.
// Phase 1: matrix 297 rows 127 cols
[2024-06-02 18:55:23] [INFO ] Computed 10 invariants in 38 ms
[2024-06-02 18:55:24] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-02 18:55:24] [INFO ] Invariant cache hit.
[2024-06-02 18:55:24] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 18:55:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/127 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:29] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 38 ms to minimize.
[2024-06-02 18:55:29] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-06-02 18:55:30] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:55:30] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:55:30] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-06-02 18:55:30] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:55:30] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:55:31] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:55:31] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 3 ms to minimize.
[2024-06-02 18:55:31] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:55:31] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:55:31] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:55:32] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:55:35] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 8/31 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:55:37] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/34 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/34 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 297/424 variables, 127/161 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:55:41] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:55:42] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-06-02 18:55:42] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:55:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 9/170 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:45] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:55:45] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/172 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:55:49] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:55:50] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 2/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 174 constraints, problems are : Problem set: 64 solved, 232 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 64 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 37/47 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 297/424 variables, 127/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 232/406 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:56:06] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 3 ms to minimize.
[2024-06-02 18:56:06] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-06-02 18:56:07] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-06-02 18:56:07] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-02 18:56:08] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2024-06-02 18:56:08] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-06-02 18:56:08] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:56:10] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 8/414 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 18:56:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:56:19] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 2 ms to minimize.
[2024-06-02 18:56:19] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 3/417 constraints. Problems are: Problem set: 64 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 417 constraints, problems are : Problem set: 64 solved, 232 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 232/296 constraints, Known Traps: 48/48 constraints]
After SMT, in 61269ms problems are : Problem set: 64 solved, 232 unsolved
Search for dead transitions found 64 dead transitions in 61325ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/145 places, 233/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62346 ms. Remains : 127/145 places, 233/313 transitions.
Support contains 84 out of 127 places after structural reductions.
[2024-06-02 18:56:26] [INFO ] Flatten gal took : 112 ms
[2024-06-02 18:56:26] [INFO ] Flatten gal took : 51 ms
[2024-06-02 18:56:26] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 82 out of 127 places (down from 84) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (1310 resets) in 2891 ms. (13 steps per ms) remains 53/85 properties
BEST_FIRST walk for 4002 steps (28 resets) in 58 ms. (67 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (26 resets) in 57 ms. (69 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (28 resets) in 50 ms. (78 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (27 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (25 resets) in 51 ms. (76 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (27 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (30 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (22 resets) in 15 ms. (250 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4004 steps (30 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (27 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (22 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (25 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (29 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (24 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 58 ms. (67 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (26 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (27 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (26 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (26 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (27 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (24 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (26 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (26 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
// Phase 1: matrix 233 rows 127 cols
[2024-06-02 18:56:28] [INFO ] Computed 10 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/90 variables, 4/6 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 4 (OVERLAPS) 25/115 variables, 4/10 constraints. Problems are: Problem set: 19 solved, 33 unsolved
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/12 constraints. Problems are: Problem set: 19 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 225/340 variables, 115/127 constraints. Problems are: Problem set: 19 solved, 33 unsolved
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 2/129 constraints. Problems are: Problem set: 19 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/129 constraints. Problems are: Problem set: 19 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 16/356 variables, 10/139 constraints. Problems are: Problem set: 19 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/139 constraints. Problems are: Problem set: 19 solved, 33 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 12 (OVERLAPS) 4/360 variables, 2/141 constraints. Problems are: Problem set: 20 solved, 32 unsolved
[2024-06-02 18:56:30] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 1/142 constraints. Problems are: Problem set: 20 solved, 32 unsolved
[2024-06-02 18:56:31] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/143 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/143 constraints. Problems are: Problem set: 20 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/360 variables, 0/143 constraints. Problems are: Problem set: 20 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 143 constraints, problems are : Problem set: 20 solved, 32 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 32 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/79 variables, 4/4 constraints. Problems are: Problem set: 23 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 23 solved, 29 unsolved
Problem AtomicPropp80 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/113 variables, 6/10 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/15 constraints. Problems are: Problem set: 24 solved, 28 unsolved
[2024-06-02 18:56:32] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:56:32] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:56:33] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 7/22 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 224/337 variables, 113/135 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 16/151 constraints. Problems are: Problem set: 24 solved, 28 unsolved
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 3/154 constraints. Problems are: Problem set: 24 solved, 28 unsolved
[2024-06-02 18:56:34] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 1/155 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/155 constraints. Problems are: Problem set: 24 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 18/355 variables, 11/166 constraints. Problems are: Problem set: 24 solved, 28 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 12/178 constraints. Problems are: Problem set: 25 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 1/179 constraints. Problems are: Problem set: 25 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/179 constraints. Problems are: Problem set: 25 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 5/360 variables, 3/182 constraints. Problems are: Problem set: 25 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 182 constraints, problems are : Problem set: 25 solved, 27 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 28/52 constraints, Known Traps: 17/17 constraints]
After SMT, in 9139ms problems are : Problem set: 25 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 124 transition count 223
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 118 transition count 221
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 116 transition count 220
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 19 place count 116 transition count 215
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 29 place count 111 transition count 215
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 43 place count 97 transition count 196
Iterating global reduction 3 with 14 rules applied. Total rules applied 57 place count 97 transition count 196
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 75 place count 88 transition count 187
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 83 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 102 place count 83 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 83 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 82 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 104 place count 82 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 81 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 81 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 79 transition count 194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 79 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 112 place count 78 transition count 193
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 115 place count 78 transition count 193
Applied a total of 115 rules in 151 ms. Remains 78 /127 variables (removed 49) and now considering 193/233 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 78/127 places, 193/233 transitions.
RANDOM walk for 40000 steps (3081 resets) in 674 ms. (59 steps per ms) remains 11/27 properties
BEST_FIRST walk for 40002 steps (822 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (805 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (845 resets) in 237 ms. (168 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (825 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (802 resets) in 95 ms. (416 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (832 resets) in 70 ms. (563 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (793 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (808 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (811 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (760 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
// Phase 1: matrix 193 rows 78 cols
[2024-06-02 18:56:38] [INFO ] Computed 11 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 25/77 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 193/270 variables, 77/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 90 constraints, problems are : Problem set: 0 solved, 7 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 25/77 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 193/270 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 97 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2119ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 1074 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 193/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 78 transition count 188
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 73 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 72 transition count 187
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 72 transition count 183
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 68 transition count 183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 65 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 65 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 65 transition count 179
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 28 place count 64 transition count 179
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 60 place count 47 transition count 164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 41 transition count 208
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 88 place count 41 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 41 transition count 182
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 41 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 38 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 38 transition count 177
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 38 transition count 177
Applied a total of 107 rules in 68 ms. Remains 38 /78 variables (removed 40) and now considering 177/193 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 38/78 places, 177/193 transitions.
RANDOM walk for 40000 steps (6368 resets) in 2130 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1578 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9687 steps, run visited all 1 properties in 43 ms. (steps per millisecond=225 )
Probabilistic random walk after 9687 steps, saw 2597 distinct states, run finished after 49 ms. (steps per millisecond=197 ) properties seen :1
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 55 out of 127 places (down from 57) after GAL structural reductions.
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 207
Applied a total of 42 rules in 8 ms. Remains 106 /127 variables (removed 21) and now considering 207/233 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 106/127 places, 207/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 8 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 205
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 8 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 105/127 places, 205/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 206
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 206
Applied a total of 44 rules in 5 ms. Remains 105 /127 variables (removed 22) and now considering 206/233 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/127 places, 206/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 206
Applied a total of 42 rules in 6 ms. Remains 106 /127 variables (removed 21) and now considering 206/233 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/127 places, 206/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 5 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 108 transition count 210
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 108 transition count 210
Applied a total of 38 rules in 13 ms. Remains 108 /127 variables (removed 19) and now considering 210/233 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 108/127 places, 210/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 123 transition count 212
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 106 transition count 208
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 104 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 104 transition count 201
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 53 place count 99 transition count 201
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 74 place count 78 transition count 173
Iterating global reduction 3 with 21 rules applied. Total rules applied 95 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 171
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 99 place count 76 transition count 171
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 129 place count 60 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 59 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 59 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 59 transition count 149
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 3 with 2 rules applied. Total rules applied 139 place count 59 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 57 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 57 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 55 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 53 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 51 transition count 141
Applied a total of 151 rules in 44 ms. Remains 51 /127 variables (removed 76) and now considering 141/233 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 51/127 places, 141/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 123 transition count 213
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 107 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 42 place count 105 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 104 transition count 206
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 43 place count 104 transition count 200
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 55 place count 98 transition count 200
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 76 place count 77 transition count 172
Iterating global reduction 4 with 21 rules applied. Total rules applied 97 place count 77 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 97 place count 77 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 76 transition count 171
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 126 place count 62 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 61 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 61 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 61 transition count 150
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 4 with 2 rules applied. Total rules applied 136 place count 61 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 138 place count 59 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 138 place count 59 transition count 146
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 142 place count 57 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 146 place count 55 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 53 transition count 142
Applied a total of 148 rules in 39 ms. Remains 53 /127 variables (removed 74) and now considering 142/233 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 53/127 places, 142/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:42] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 206
Applied a total of 42 rules in 3 ms. Remains 106 /127 variables (removed 21) and now considering 206/233 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/127 places, 206/233 transitions.
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:43] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 123 transition count 212
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 19 rules applied. Total rules applied 37 place count 106 transition count 210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 105 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 104 transition count 207
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 42 place count 104 transition count 202
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 52 place count 99 transition count 202
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 73 place count 78 transition count 174
Iterating global reduction 4 with 21 rules applied. Total rules applied 94 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 94 place count 78 transition count 172
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 98 place count 76 transition count 172
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 128 place count 60 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 59 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 59 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 59 transition count 150
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 4 with 2 rules applied. Total rules applied 138 place count 59 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 57 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 140 place count 57 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 144 place count 55 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 148 place count 53 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 51 transition count 142
Applied a total of 150 rules in 37 ms. Remains 51 /127 variables (removed 76) and now considering 142/233 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 51/127 places, 142/233 transitions.
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:43] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (5171 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (981 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125953 steps, run visited all 1 properties in 209 ms. (steps per millisecond=602 )
Probabilistic random walk after 125953 steps, saw 29351 distinct states, run finished after 209 ms. (steps per millisecond=602 ) properties seen :1
FORMULA MedleyA-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 3 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:43] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 211
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 105 transition count 207
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 103 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 103 transition count 200
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 55 place count 98 transition count 200
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 75 place count 78 transition count 173
Iterating global reduction 3 with 20 rules applied. Total rules applied 95 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 171
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 99 place count 76 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 130 place count 60 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 59 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 59 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 59 transition count 148
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 3 with 2 rules applied. Total rules applied 140 place count 59 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 57 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 142 place count 57 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 146 place count 55 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 53 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 51 transition count 140
Applied a total of 152 rules in 30 ms. Remains 51 /127 variables (removed 76) and now considering 140/233 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 51/127 places, 140/233 transitions.
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:56:43] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 205
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 2 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 105/127 places, 205/233 transitions.
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:43] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:56:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:56:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-02 18:56:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 233 transitions and 1033 arcs took 4 ms.
Total runtime 80840 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-09-CTLFireability-2024-15

BK_STOP 1717354604124

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-09-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/787/ctl_0_
ctl formula name MedleyA-PT-09-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/787/ctl_1_
ctl formula name MedleyA-PT-09-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/787/ctl_2_
ctl formula name MedleyA-PT-09-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/787/ctl_3_
ctl formula name MedleyA-PT-09-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/787/ctl_4_
ctl formula name MedleyA-PT-09-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/787/ctl_5_
ctl formula name MedleyA-PT-09-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/787/ctl_6_
ctl formula name MedleyA-PT-09-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/787/ctl_7_
ctl formula name MedleyA-PT-09-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/787/ctl_8_
ctl formula name MedleyA-PT-09-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/787/ctl_9_
ctl formula name MedleyA-PT-09-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/787/ctl_10_
ctl formula name MedleyA-PT-09-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/787/ctl_11_
ctl formula name MedleyA-PT-09-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/787/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

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