Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261744107

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:09:06] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2024-06-01 17:09:06] [INFO ] Transformed 889 places.
[2024-06-01 17:09:06] [INFO ] Transformed 4152 transitions.
[2024-06-01 17:09:06] [INFO ] Found NUPN structural information;
[2024-06-01 17:09:06] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 82 ms.
Support contains 102 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 682 transition count 2229
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 682 transition count 2229
Applied a total of 414 rules in 212 ms. Remains 682 /889 variables (removed 207) and now considering 2229/4152 (removed 1923) transitions.
// Phase 1: matrix 2229 rows 682 cols
[2024-06-01 17:09:07] [INFO ] Computed 27 invariants in 131 ms
[2024-06-01 17:09:08] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2024-06-01 17:09:08] [INFO ] Invariant cache hit.
[2024-06-01 17:09:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:09:18] [INFO ] Implicit Places using invariants and state equation in 10268 ms returned []
Implicit Place search using SMT with State Equation took 11597 ms to find 0 implicit places.
Running 2217 sub problems to find dead transitions.
[2024-06-01 17:09:18] [INFO ] Invariant cache hit.
[2024-06-01 17:09:18] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/2911 variables, and 27 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/682 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 17:10:00] [INFO ] Deduced a trap composed of 106 places in 655 ms of which 62 ms to minimize.
[2024-06-01 17:10:01] [INFO ] Deduced a trap composed of 163 places in 805 ms of which 11 ms to minimize.
[2024-06-01 17:10:01] [INFO ] Deduced a trap composed of 126 places in 720 ms of which 7 ms to minimize.
[2024-06-01 17:10:02] [INFO ] Deduced a trap composed of 206 places in 625 ms of which 6 ms to minimize.
[2024-06-01 17:10:03] [INFO ] Deduced a trap composed of 115 places in 870 ms of which 7 ms to minimize.
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 213 places in 767 ms of which 6 ms to minimize.
[2024-06-01 17:10:05] [INFO ] Deduced a trap composed of 185 places in 762 ms of which 7 ms to minimize.
[2024-06-01 17:10:05] [INFO ] Deduced a trap composed of 136 places in 751 ms of which 6 ms to minimize.
[2024-06-01 17:10:06] [INFO ] Deduced a trap composed of 147 places in 799 ms of which 6 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 320 places in 858 ms of which 7 ms to minimize.
[2024-06-01 17:10:08] [INFO ] Deduced a trap composed of 132 places in 854 ms of which 9 ms to minimize.
[2024-06-01 17:10:09] [INFO ] Deduced a trap composed of 166 places in 971 ms of which 9 ms to minimize.
[2024-06-01 17:10:10] [INFO ] Deduced a trap composed of 319 places in 1004 ms of which 10 ms to minimize.
[2024-06-01 17:10:11] [INFO ] Deduced a trap composed of 257 places in 998 ms of which 7 ms to minimize.
[2024-06-01 17:10:12] [INFO ] Deduced a trap composed of 214 places in 867 ms of which 7 ms to minimize.
[2024-06-01 17:10:13] [INFO ] Deduced a trap composed of 151 places in 912 ms of which 7 ms to minimize.
[2024-06-01 17:10:14] [INFO ] Deduced a trap composed of 266 places in 791 ms of which 7 ms to minimize.
[2024-06-01 17:10:15] [INFO ] Deduced a trap composed of 167 places in 814 ms of which 6 ms to minimize.
[2024-06-01 17:10:16] [INFO ] Deduced a trap composed of 163 places in 856 ms of which 6 ms to minimize.
[2024-06-01 17:10:17] [INFO ] Deduced a trap composed of 206 places in 862 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 225 places in 837 ms of which 6 ms to minimize.
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 227 places in 789 ms of which 6 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 242 places in 789 ms of which 7 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 181 places in 669 ms of which 7 ms to minimize.
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 168 places in 736 ms of which 6 ms to minimize.
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 309 places in 751 ms of which 7 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 226 places in 784 ms of which 7 ms to minimize.
(s367 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/2911 variables, and 54 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/682 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 27/27 constraints]
After SMT, in 67280ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 67349ms
Starting structural reductions in LTL mode, iteration 1 : 682/889 places, 2229/4152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79216 ms. Remains : 682/889 places, 2229/4152 transitions.
Support contains 102 out of 682 places after structural reductions.
[2024-06-01 17:10:26] [INFO ] Flatten gal took : 279 ms
[2024-06-01 17:10:26] [INFO ] Flatten gal took : 188 ms
[2024-06-01 17:10:27] [INFO ] Input system was already deterministic with 2229 transitions.
RANDOM walk for 40000 steps (8 resets) in 3048 ms. (13 steps per ms) remains 43/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
[2024-06-01 17:10:28] [INFO ] Invariant cache hit.
[2024-06-01 17:10:28] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 606/678 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 8/21 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/682 variables, 6/27 constraints. Problems are: Problem set: 3 solved, 35 unsolved
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 268 places in 871 ms of which 7 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 303 places in 685 ms of which 6 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 225 places in 978 ms of which 7 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 143 places in 946 ms of which 6 ms to minimize.
SMT process timed out in 5499ms, After SMT, problems are : Problem set: 3 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 130 Pre rules applied. Total rules applied 0 place count 682 transition count 2099
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 552 transition count 2099
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 280 place count 532 transition count 1661
Iterating global reduction 0 with 20 rules applied. Total rules applied 300 place count 532 transition count 1661
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 304 place count 530 transition count 1659
Applied a total of 304 rules in 231 ms. Remains 530 /682 variables (removed 152) and now considering 1659/2229 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 530/682 places, 1659/2229 transitions.
RANDOM walk for 40000 steps (8 resets) in 983 ms. (40 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/24 properties
// Phase 1: matrix 1659 rows 530 cols
[2024-06-01 17:10:35] [INFO ] Computed 27 invariants in 53 ms
[2024-06-01 17:10:35] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 479/520 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 10/530 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:10:36] [INFO ] Deduced a trap composed of 157 places in 598 ms of which 5 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 85 places in 636 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 204 places in 632 ms of which 5 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 90 places in 624 ms of which 9 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 175 places in 627 ms of which 5 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 145 places in 603 ms of which 5 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 172 places in 620 ms of which 5 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 148 places in 492 ms of which 5 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 276 places in 642 ms of which 5 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 170 places in 645 ms of which 6 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 237 places in 627 ms of which 5 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 235 places in 622 ms of which 5 ms to minimize.
[2024-06-01 17:10:44] [INFO ] Deduced a trap composed of 183 places in 607 ms of which 5 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 183 places in 640 ms of which 6 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 162 places in 663 ms of which 6 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 107 places in 631 ms of which 5 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 205 places in 631 ms of which 5 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 246 places in 614 ms of which 6 ms to minimize.
[2024-06-01 17:10:48] [INFO ] Deduced a trap composed of 233 places in 635 ms of which 5 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 156 places in 643 ms of which 5 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 101 places in 633 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:10:50] [INFO ] Deduced a trap composed of 149 places in 540 ms of which 5 ms to minimize.
[2024-06-01 17:10:51] [INFO ] Deduced a trap composed of 141 places in 604 ms of which 5 ms to minimize.
[2024-06-01 17:10:51] [INFO ] Deduced a trap composed of 108 places in 602 ms of which 5 ms to minimize.
[2024-06-01 17:10:52] [INFO ] Deduced a trap composed of 206 places in 605 ms of which 5 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 182 places in 606 ms of which 6 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 166 places in 599 ms of which 6 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 102 places in 542 ms of which 5 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 86 places in 603 ms of which 5 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 161 places in 589 ms of which 5 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 228 places in 589 ms of which 5 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 178 places in 593 ms of which 5 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 214 places in 587 ms of which 5 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 232 places in 599 ms of which 6 ms to minimize.
[2024-06-01 17:10:58] [INFO ] Deduced a trap composed of 126 places in 598 ms of which 5 ms to minimize.
[2024-06-01 17:10:59] [INFO ] Deduced a trap composed of 129 places in 578 ms of which 5 ms to minimize.
[2024-06-01 17:10:59] [INFO ] Deduced a trap composed of 188 places in 627 ms of which 5 ms to minimize.
[2024-06-01 17:11:00] [INFO ] Deduced a trap composed of 118 places in 611 ms of which 5 ms to minimize.
[2024-06-01 17:11:00] [INFO ] Deduced a trap composed of 66 places in 577 ms of which 5 ms to minimize.
[2024-06-01 17:11:01] [INFO ] Deduced a trap composed of 82 places in 582 ms of which 5 ms to minimize.
[2024-06-01 17:11:02] [INFO ] Deduced a trap composed of 146 places in 519 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:11:03] [INFO ] Deduced a trap composed of 117 places in 610 ms of which 5 ms to minimize.
[2024-06-01 17:11:03] [INFO ] Deduced a trap composed of 194 places in 594 ms of which 5 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 331 places in 586 ms of which 5 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Deduced a trap composed of 219 places in 584 ms of which 5 ms to minimize.
[2024-06-01 17:11:05] [INFO ] Deduced a trap composed of 118 places in 610 ms of which 5 ms to minimize.
[2024-06-01 17:11:06] [INFO ] Deduced a trap composed of 197 places in 606 ms of which 5 ms to minimize.
[2024-06-01 17:11:06] [INFO ] Deduced a trap composed of 198 places in 601 ms of which 5 ms to minimize.
[2024-06-01 17:11:07] [INFO ] Deduced a trap composed of 131 places in 607 ms of which 5 ms to minimize.
[2024-06-01 17:11:07] [INFO ] Deduced a trap composed of 205 places in 629 ms of which 6 ms to minimize.
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 201 places in 606 ms of which 5 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 61 places in 594 ms of which 5 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 96 places in 603 ms of which 5 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 96 places in 614 ms of which 5 ms to minimize.
[2024-06-01 17:11:11] [INFO ] Deduced a trap composed of 162 places in 599 ms of which 4 ms to minimize.
[2024-06-01 17:11:12] [INFO ] Deduced a trap composed of 124 places in 629 ms of which 5 ms to minimize.
[2024-06-01 17:11:12] [INFO ] Deduced a trap composed of 186 places in 615 ms of which 5 ms to minimize.
[2024-06-01 17:11:13] [INFO ] Deduced a trap composed of 103 places in 618 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 17/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:11:14] [INFO ] Deduced a trap composed of 199 places in 628 ms of which 6 ms to minimize.
[2024-06-01 17:11:15] [INFO ] Deduced a trap composed of 125 places in 601 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:11:16] [INFO ] Deduced a trap composed of 185 places in 592 ms of which 5 ms to minimize.
[2024-06-01 17:11:17] [INFO ] Deduced a trap composed of 191 places in 588 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:11:18] [INFO ] Deduced a trap composed of 125 places in 640 ms of which 6 ms to minimize.
[2024-06-01 17:11:19] [INFO ] Deduced a trap composed of 235 places in 632 ms of which 5 ms to minimize.
[2024-06-01 17:11:20] [INFO ] Deduced a trap composed of 202 places in 593 ms of which 6 ms to minimize.
SMT process timed out in 45482ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1659/1659 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 518 transition count 1383
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 518 transition count 1383
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 517 transition count 1382
Applied a total of 26 rules in 302 ms. Remains 517 /530 variables (removed 13) and now considering 1382/1659 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 517/530 places, 1382/1659 transitions.
RANDOM walk for 40000 steps (8 resets) in 670 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 113020 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :2 out of 21
Probabilistic random walk after 113020 steps, saw 90141 distinct states, run finished after 3007 ms. (steps per millisecond=37 ) properties seen :2
// Phase 1: matrix 1382 rows 517 cols
[2024-06-01 17:11:24] [INFO ] Computed 27 invariants in 19 ms
[2024-06-01 17:11:24] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 472/507 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 10/517 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:11:25] [INFO ] Deduced a trap composed of 177 places in 464 ms of which 6 ms to minimize.
[2024-06-01 17:11:26] [INFO ] Deduced a trap composed of 235 places in 625 ms of which 5 ms to minimize.
[2024-06-01 17:11:26] [INFO ] Deduced a trap composed of 249 places in 756 ms of which 8 ms to minimize.
[2024-06-01 17:11:27] [INFO ] Deduced a trap composed of 295 places in 830 ms of which 8 ms to minimize.
[2024-06-01 17:11:28] [INFO ] Deduced a trap composed of 131 places in 781 ms of which 8 ms to minimize.
[2024-06-01 17:11:29] [INFO ] Deduced a trap composed of 218 places in 804 ms of which 7 ms to minimize.
[2024-06-01 17:11:30] [INFO ] Deduced a trap composed of 216 places in 804 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:11:31] [INFO ] Deduced a trap composed of 200 places in 756 ms of which 8 ms to minimize.
[2024-06-01 17:11:32] [INFO ] Deduced a trap composed of 144 places in 596 ms of which 8 ms to minimize.
[2024-06-01 17:11:32] [INFO ] Deduced a trap composed of 226 places in 789 ms of which 8 ms to minimize.
[2024-06-01 17:11:33] [INFO ] Deduced a trap composed of 125 places in 760 ms of which 5 ms to minimize.
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 205 places in 664 ms of which 5 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 132 places in 619 ms of which 6 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 172 places in 784 ms of which 8 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 140 places in 776 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 91 places in 828 ms of which 8 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 131 places in 835 ms of which 8 ms to minimize.
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 98 places in 833 ms of which 8 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 170 places in 833 ms of which 9 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 125 places in 820 ms of which 8 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 231 places in 744 ms of which 8 ms to minimize.
[2024-06-01 17:11:43] [INFO ] Deduced a trap composed of 114 places in 825 ms of which 8 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 169 places in 864 ms of which 8 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 170 places in 705 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 178 places in 812 ms of which 8 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 168 places in 615 ms of which 5 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 138 places in 800 ms of which 9 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 218 places in 810 ms of which 7 ms to minimize.
[2024-06-01 17:11:49] [INFO ] Deduced a trap composed of 190 places in 818 ms of which 8 ms to minimize.
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 277 places in 760 ms of which 7 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 143 places in 637 ms of which 5 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 187 places in 744 ms of which 6 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 213 places in 631 ms of which 7 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 152 places in 776 ms of which 7 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 261 places in 791 ms of which 8 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 80 places in 769 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1382/1899 variables, 517/580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1899 variables, 132/712 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1899 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/1899 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1899/1899 variables, and 712 constraints, problems are : Problem set: 0 solved, 19 unsolved in 38681 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 517/517 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 472/507 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 10/517 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 36/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:12:04] [INFO ] Deduced a trap composed of 269 places in 490 ms of which 5 ms to minimize.
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 237 places in 505 ms of which 5 ms to minimize.
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 231 places in 510 ms of which 6 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 311 places in 530 ms of which 5 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 163 places in 628 ms of which 7 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 326 places in 727 ms of which 7 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 126 places in 730 ms of which 8 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 163 places in 773 ms of which 8 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 171 places in 780 ms of which 8 ms to minimize.
[2024-06-01 17:12:11] [INFO ] Deduced a trap composed of 109 places in 786 ms of which 8 ms to minimize.
[2024-06-01 17:12:11] [INFO ] Deduced a trap composed of 117 places in 757 ms of which 9 ms to minimize.
[2024-06-01 17:12:12] [INFO ] Deduced a trap composed of 289 places in 780 ms of which 7 ms to minimize.
[2024-06-01 17:12:13] [INFO ] Deduced a trap composed of 168 places in 763 ms of which 9 ms to minimize.
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 165 places in 814 ms of which 7 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 130 places in 772 ms of which 7 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 120 places in 846 ms of which 8 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 166 places in 760 ms of which 8 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 169 places in 693 ms of which 8 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 127 places in 756 ms of which 7 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 221 places in 756 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:12:20] [INFO ] Deduced a trap composed of 271 places in 779 ms of which 8 ms to minimize.
[2024-06-01 17:12:21] [INFO ] Deduced a trap composed of 166 places in 789 ms of which 7 ms to minimize.
[2024-06-01 17:12:22] [INFO ] Deduced a trap composed of 172 places in 725 ms of which 8 ms to minimize.
[2024-06-01 17:12:23] [INFO ] Deduced a trap composed of 249 places in 854 ms of which 8 ms to minimize.
[2024-06-01 17:12:24] [INFO ] Deduced a trap composed of 214 places in 770 ms of which 7 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 288 places in 793 ms of which 8 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 292 places in 830 ms of which 8 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 130 places in 817 ms of which 8 ms to minimize.
[2024-06-01 17:12:27] [INFO ] Deduced a trap composed of 288 places in 829 ms of which 7 ms to minimize.
[2024-06-01 17:12:28] [INFO ] Deduced a trap composed of 183 places in 834 ms of which 8 ms to minimize.
[2024-06-01 17:12:29] [INFO ] Deduced a trap composed of 125 places in 827 ms of which 8 ms to minimize.
[2024-06-01 17:12:30] [INFO ] Deduced a trap composed of 285 places in 805 ms of which 8 ms to minimize.
[2024-06-01 17:12:30] [INFO ] Deduced a trap composed of 91 places in 804 ms of which 8 ms to minimize.
[2024-06-01 17:12:31] [INFO ] Deduced a trap composed of 321 places in 792 ms of which 8 ms to minimize.
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 106 places in 836 ms of which 8 ms to minimize.
[2024-06-01 17:12:33] [INFO ] Deduced a trap composed of 271 places in 826 ms of which 8 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 250 places in 837 ms of which 8 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 179 places in 837 ms of which 8 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 97 places in 873 ms of which 8 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 171 places in 826 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 167 places in 530 ms of which 5 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 168 places in 662 ms of which 7 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 213 places in 787 ms of which 8 ms to minimize.
[2024-06-01 17:12:41] [INFO ] Deduced a trap composed of 131 places in 835 ms of which 8 ms to minimize.
[2024-06-01 17:12:42] [INFO ] Deduced a trap composed of 219 places in 802 ms of which 7 ms to minimize.
[2024-06-01 17:12:43] [INFO ] Deduced a trap composed of 271 places in 773 ms of which 8 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 87 places in 821 ms of which 7 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 98 places in 694 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 200 places in 553 ms of which 8 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 236 places in 791 ms of which 8 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 185 places in 835 ms of which 8 ms to minimize.
[2024-06-01 17:12:49] [INFO ] Deduced a trap composed of 93 places in 834 ms of which 8 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 157 places in 778 ms of which 9 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 125 places in 849 ms of which 8 ms to minimize.
[2024-06-01 17:12:53] [INFO ] Deduced a trap composed of 225 places in 880 ms of which 8 ms to minimize.
[2024-06-01 17:12:54] [INFO ] Deduced a trap composed of 342 places in 818 ms of which 8 ms to minimize.
[2024-06-01 17:12:55] [INFO ] Deduced a trap composed of 332 places in 791 ms of which 8 ms to minimize.
[2024-06-01 17:12:56] [INFO ] Deduced a trap composed of 260 places in 761 ms of which 7 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 344 places in 793 ms of which 7 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 327 places in 844 ms of which 8 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 187 places in 837 ms of which 9 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 266 places in 860 ms of which 8 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 257 places in 852 ms of which 8 ms to minimize.
[2024-06-01 17:13:01] [INFO ] Deduced a trap composed of 264 places in 811 ms of which 8 ms to minimize.
[2024-06-01 17:13:02] [INFO ] Deduced a trap composed of 211 places in 810 ms of which 8 ms to minimize.
[2024-06-01 17:13:03] [INFO ] Deduced a trap composed of 180 places in 820 ms of which 8 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 270 places in 885 ms of which 9 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 263 places in 867 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 225 places in 828 ms of which 8 ms to minimize.
[2024-06-01 17:13:09] [INFO ] Deduced a trap composed of 224 places in 782 ms of which 8 ms to minimize.
[2024-06-01 17:13:10] [INFO ] Deduced a trap composed of 227 places in 810 ms of which 8 ms to minimize.
[2024-06-01 17:13:11] [INFO ] Deduced a trap composed of 239 places in 811 ms of which 7 ms to minimize.
[2024-06-01 17:13:11] [INFO ] Deduced a trap composed of 196 places in 845 ms of which 8 ms to minimize.
[2024-06-01 17:13:12] [INFO ] Deduced a trap composed of 101 places in 814 ms of which 8 ms to minimize.
[2024-06-01 17:13:13] [INFO ] Deduced a trap composed of 159 places in 808 ms of which 8 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 311 places in 791 ms of which 7 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 277 places in 778 ms of which 8 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 116 places in 756 ms of which 8 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 160 places in 842 ms of which 8 ms to minimize.
[2024-06-01 17:13:17] [INFO ] Deduced a trap composed of 266 places in 894 ms of which 8 ms to minimize.
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 215 places in 865 ms of which 8 ms to minimize.
SMT process timed out in 114595ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 1382/1382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 513 transition count 1290
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 513 transition count 1290
Applied a total of 8 rules in 262 ms. Remains 513 /517 variables (removed 4) and now considering 1290/1382 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 513/517 places, 1290/1382 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:13:19] [INFO ] Flatten gal took : 145 ms
[2024-06-01 17:13:19] [INFO ] Flatten gal took : 162 ms
[2024-06-01 17:13:19] [INFO ] Input system was already deterministic with 2229 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 632 transition count 1145
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 632 transition count 1145
Applied a total of 100 rules in 210 ms. Remains 632 /682 variables (removed 50) and now considering 1145/2229 (removed 1084) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 632/682 places, 1145/2229 transitions.
[2024-06-01 17:13:20] [INFO ] Flatten gal took : 43 ms
[2024-06-01 17:13:20] [INFO ] Flatten gal took : 46 ms
[2024-06-01 17:13:20] [INFO ] Input system was already deterministic with 1145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 2 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 320 place count 494 transition count 875
Iterating global reduction 0 with 56 rules applied. Total rules applied 376 place count 494 transition count 875
Applied a total of 376 rules in 186 ms. Remains 494 /682 variables (removed 188) and now considering 875/2229 (removed 1354) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 186 ms. Remains : 494/682 places, 875/2229 transitions.
[2024-06-01 17:13:20] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:13:20] [INFO ] Flatten gal took : 30 ms
[2024-06-01 17:13:20] [INFO ] Input system was already deterministic with 875 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 404 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-06-01 17:13:20] [INFO ] Flatten gal took : 38 ms
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 39 ms
[2024-06-01 17:13:21] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 638 transition count 1261
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 638 transition count 1261
Applied a total of 88 rules in 210 ms. Remains 638 /682 variables (removed 44) and now considering 1261/2229 (removed 968) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 638/682 places, 1261/2229 transitions.
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 38 ms
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 43 ms
[2024-06-01 17:13:21] [INFO ] Input system was already deterministic with 1261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 628 transition count 1031
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 628 transition count 1031
Applied a total of 108 rules in 46 ms. Remains 628 /682 variables (removed 54) and now considering 1031/2229 (removed 1198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 628/682 places, 1031/2229 transitions.
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 32 ms
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 36 ms
[2024-06-01 17:13:21] [INFO ] Input system was already deterministic with 1031 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 320 place count 494 transition count 875
Iterating global reduction 0 with 56 rules applied. Total rules applied 376 place count 494 transition count 875
Applied a total of 376 rules in 66 ms. Remains 494 /682 variables (removed 188) and now considering 875/2229 (removed 1354) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 494/682 places, 875/2229 transitions.
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 27 ms
[2024-06-01 17:13:21] [INFO ] Flatten gal took : 30 ms
[2024-06-01 17:13:21] [INFO ] Input system was already deterministic with 875 transitions.
RANDOM walk for 40000 steps (8 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 884536 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 884536 steps, saw 693006 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
// Phase 1: matrix 875 rows 494 cols
[2024-06-01 17:13:25] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 17:13:25] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/494 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 875/1369 variables, 494/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1369 variables, 132/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1369 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/494 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 875/1369 variables, 494/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 25 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 494/494 places, 875/875 transitions.
RANDOM walk for 400000 steps (8 resets) in 3672 ms. (108 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-01 17:13:28] [INFO ] Invariant cache hit.
[2024-06-01 17:13:28] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 17:13:28] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 23 ms returned sat
[2024-06-01 17:13:29] [INFO ] After 621ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 17:13:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:13:29] [INFO ] After 70ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:13:29] [INFO ] After 256ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:13:29] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:13:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2024-06-01 17:13:29] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 38 ms returned sat
[2024-06-01 17:13:30] [INFO ] After 922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 17:13:30] [INFO ] After 296ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:13:31] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:13:31] [INFO ] After 1684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 15740 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5237 ms. (763 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4047640 steps, run timeout after 15001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 4047640 steps, saw 3057271 distinct states, run finished after 15001 ms. (steps per millisecond=269 ) properties seen :0
[2024-06-01 17:13:51] [INFO ] Invariant cache hit.
[2024-06-01 17:13:51] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 412 places in 496 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/494 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 875/1369 variables, 494/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 132/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 654 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/458 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/481 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/494 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 875/1369 variables, 494/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 132/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 655 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 494/494 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 23 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 494/494 places, 875/875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 875/875 transitions.
Applied a total of 0 rules in 23 ms. Remains 494 /494 variables (removed 0) and now considering 875/875 (removed 0) transitions.
[2024-06-01 17:13:54] [INFO ] Invariant cache hit.
[2024-06-01 17:13:56] [INFO ] Implicit Places using invariants in 1703 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1708 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 493/494 places, 875/875 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 349 transition count 731
Applied a total of 288 rules in 59 ms. Remains 349 /493 variables (removed 144) and now considering 731/875 (removed 144) transitions.
// Phase 1: matrix 731 rows 349 cols
[2024-06-01 17:13:56] [INFO ] Computed 26 invariants in 9 ms
[2024-06-01 17:13:57] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-06-01 17:13:57] [INFO ] Invariant cache hit.
[2024-06-01 17:13:57] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:13:59] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3560 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 349/494 places, 731/875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5353 ms. Remains : 349/494 places, 731/875 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10871 ms. (367 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1366454 steps (3 resets) in 2115 ms. (645 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-12-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 43 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 34 ms
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 17:14:04] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 635 transition count 1214
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 635 transition count 1214
Applied a total of 94 rules in 39 ms. Remains 635 /682 variables (removed 47) and now considering 1214/2229 (removed 1015) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 635/682 places, 1214/2229 transitions.
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 35 ms
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 40 ms
[2024-06-01 17:14:04] [INFO ] Input system was already deterministic with 1214 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 682 transition count 2098
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 551 transition count 2098
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 312 place count 501 transition count 1014
Iterating global reduction 0 with 50 rules applied. Total rules applied 362 place count 501 transition count 1014
Applied a total of 362 rules in 59 ms. Remains 501 /682 variables (removed 181) and now considering 1014/2229 (removed 1215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 501/682 places, 1014/2229 transitions.
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 30 ms
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 32 ms
[2024-06-01 17:14:04] [INFO ] Input system was already deterministic with 1014 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 625 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 625 transition count 984
Applied a total of 114 rules in 38 ms. Remains 625 /682 variables (removed 57) and now considering 984/2229 (removed 1245) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 625/682 places, 984/2229 transitions.
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 29 ms
[2024-06-01 17:14:04] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 682 transition count 2097
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 550 transition count 2097
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 318 place count 496 transition count 921
Iterating global reduction 0 with 54 rules applied. Total rules applied 372 place count 496 transition count 921
Applied a total of 372 rules in 57 ms. Remains 496 /682 variables (removed 186) and now considering 921/2229 (removed 1308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 496/682 places, 921/2229 transitions.
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 24 ms
[2024-06-01 17:14:04] [INFO ] Flatten gal took : 26 ms
[2024-06-01 17:14:04] [INFO ] Input system was already deterministic with 921 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 12818 steps (2 resets) in 20 ms. (610 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-12-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 629 transition count 1076
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 629 transition count 1076
Applied a total of 106 rules in 37 ms. Remains 629 /682 variables (removed 53) and now considering 1076/2229 (removed 1153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 629/682 places, 1076/2229 transitions.
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 32 ms
[2024-06-01 17:14:05] [INFO ] Input system was already deterministic with 1076 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 626 transition count 985
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 626 transition count 985
Applied a total of 112 rules in 37 ms. Remains 626 /682 variables (removed 56) and now considering 985/2229 (removed 1244) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 626/682 places, 985/2229 transitions.
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 26 ms
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:14:05] [INFO ] Input system was already deterministic with 985 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 625 transition count 984
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 625 transition count 984
Applied a total of 114 rules in 36 ms. Remains 625 /682 variables (removed 57) and now considering 984/2229 (removed 1245) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 625/682 places, 984/2229 transitions.
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 23 ms
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 27 ms
[2024-06-01 17:14:05] [INFO ] Input system was already deterministic with 984 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 2229/2229 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 627 transition count 1030
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 627 transition count 1030
Applied a total of 110 rules in 36 ms. Remains 627 /682 variables (removed 55) and now considering 1030/2229 (removed 1199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 627/682 places, 1030/2229 transitions.
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 25 ms
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:14:05] [INFO ] Input system was already deterministic with 1030 transitions.
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 65 ms
[2024-06-01 17:14:05] [INFO ] Flatten gal took : 69 ms
[2024-06-01 17:14:05] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 17:14:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 2229 transitions and 8646 arcs took 18 ms.
Total runtime 300071 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2023-14
Could not compute solution for formula : Anderson-PT-12-CTLFireability-2023-15

BK_STOP 1717262046423

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Anderson-PT-12-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1231/ctl_0_
ctl formula name Anderson-PT-12-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1231/ctl_1_
ctl formula name Anderson-PT-12-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1231/ctl_2_
ctl formula name Anderson-PT-12-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1231/ctl_3_
ctl formula name Anderson-PT-12-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1231/ctl_4_
ctl formula name Anderson-PT-12-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1231/ctl_5_
ctl formula name Anderson-PT-12-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1231/ctl_6_
ctl formula name Anderson-PT-12-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1231/ctl_7_
ctl formula name Anderson-PT-12-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1231/ctl_8_
ctl formula name Anderson-PT-12-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1231/ctl_9_
ctl formula name Anderson-PT-12-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1231/ctl_10_
ctl formula name Anderson-PT-12-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1231/ctl_11_
ctl formula name Anderson-PT-12-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1231/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="Anderson-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-12, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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