Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500154.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S04J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S04J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717250413675

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:00:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:00:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:00:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:00:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:00:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2024-06-01 14:00:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:00:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 14:00:15] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (11 resets) in 1933 ms. (20 steps per ms) remains 9/61 properties
BEST_FIRST walk for 40002 steps (8 resets) in 348 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (14 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
[2024-06-01 14:00:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:00:17] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 14:00:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 9 solved, 0 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
[2024-06-01 14:00:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 14:00:17] [INFO ] Flatten gal took : 29 ms
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:00:17] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:00:18] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 81 ms.
[2024-06-01 14:00:18] [INFO ] Unfolded 13 HLPN properties in 2 ms.
[2024-06-01 14:00:18] [INFO ] Reduced 48 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 352 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 352 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 14:00:18] [INFO ] Reduced 352 identical enabling conditions.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 734 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Applied a total of 0 rules in 30 ms. Remains 792 /792 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-06-01 14:00:18] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-06-01 14:00:18] [INFO ] Computed 58 invariants in 91 ms
[2024-06-01 14:00:18] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 10.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 (/ 1.0 3.0))
(s269 0.0)
(s270 1.0)
(s271 (/ 1.0 3.0))
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 (/ 2.0 3.0))
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 (/ 2.0 3.0))
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 10.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 8.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 timeout
0.0)
(s708 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2860 variables, and 50 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 20097 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 14:00:48] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 18 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:00:49] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:00:50] [INFO ] Deduced a trap composed of 189 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:00:51] [INFO ] Deduced a trap composed of 194 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:00:52] [INFO ] Deduced a trap composed of 443 places in 440 ms of which 6 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:01:04] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 4 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 414 places in 493 ms of which 6 ms to minimize.
[2024-06-01 14:01:06] [INFO ] Deduced a trap composed of 480 places in 399 ms of which 5 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 409 places in 398 ms of which 4 ms to minimize.
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 434 places in 330 ms of which 4 ms to minimize.
SMT process timed out in 49334ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 49379ms
[2024-06-01 14:01:07] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 14:01:07] [INFO ] Invariant cache hit.
[2024-06-01 14:01:07] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 14:01:07] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 14:01:07] [INFO ] Invariant cache hit.
[2024-06-01 14:01:08] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:01:14] [INFO ] Implicit Places using invariants and state equation in 6525 ms returned []
Implicit Place search using SMT with State Equation took 6684 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-06-01 14:01:14] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 14:01:14] [INFO ] Invariant cache hit.
[2024-06-01 14:01:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 14:01:44] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:01:48] [INFO ] Deduced a trap composed of 49 places in 384 ms of which 4 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:01:49] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2860 variables, and 58 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 14:01:54] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:01:56] [INFO ] Deduced a trap composed of 164 places in 500 ms of which 5 ms to minimize.
[2024-06-01 14:01:56] [INFO ] Deduced a trap composed of 215 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:01:57] [INFO ] Deduced a trap composed of 222 places in 411 ms of which 4 ms to minimize.
[2024-06-01 14:01:57] [INFO ] Deduced a trap composed of 207 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:01:58] [INFO ] Deduced a trap composed of 396 places in 471 ms of which 7 ms to minimize.
[2024-06-01 14:01:59] [INFO ] Deduced a trap composed of 456 places in 455 ms of which 5 ms to minimize.
[2024-06-01 14:02:09] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:02:11] [INFO ] Deduced a trap composed of 425 places in 562 ms of which 6 ms to minimize.
[2024-06-01 14:02:12] [INFO ] Deduced a trap composed of 426 places in 475 ms of which 6 ms to minimize.
[2024-06-01 14:02:12] [INFO ] Deduced a trap composed of 391 places in 567 ms of which 10 ms to minimize.
[2024-06-01 14:02:13] [INFO ] Deduced a trap composed of 407 places in 456 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2860 variables, and 70 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 20/20 constraints]
After SMT, in 68370ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 68417ms
Finished structural reductions in LTL mode , in 1 iterations and 124554 ms. Remains : 792/792 places, 2100/2100 transitions.
Support contains 734 out of 792 places after structural reductions.
[2024-06-01 14:02:23] [INFO ] Flatten gal took : 302 ms
[2024-06-01 14:02:23] [INFO ] Flatten gal took : 190 ms
[2024-06-01 14:02:24] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 726 out of 792 places (down from 734) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 62 to 61
RANDOM walk for 40000 steps (8 resets) in 1536 ms. (26 steps per ms) remains 7/61 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1157 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 502 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 499 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 447 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 7/7 properties
[2024-06-01 14:02:26] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 14:02:26] [INFO ] Invariant cache hit.
[2024-06-01 14:02:26] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 98/409 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/421 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 6 (OVERLAPS) 355/776 variables, 34/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/780 variables, 4/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
After SMT solving in domain Real declared 792/2860 variables, and 58 constraints, problems are : Problem set: 7 solved, 0 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/792 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3687ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2024-06-01 14:02:30] [INFO ] Flatten gal took : 156 ms
[2024-06-01 14:02:30] [INFO ] Flatten gal took : 180 ms
[2024-06-01 14:02:31] [INFO ] Input system was already deterministic with 2100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 106 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 14:02:31] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 14:02:31] [INFO ] Computed 54 invariants in 101 ms
[2024-06-01 14:02:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 334 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:03:00] [INFO ] Deduced a trap composed of 339 places in 256 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 48 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 14:03:11] [INFO ] Deduced a trap composed of 19 places in 578 ms of which 5 ms to minimize.
[2024-06-01 14:03:11] [INFO ] Deduced a trap composed of 82 places in 421 ms of which 5 ms to minimize.
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 94 places in 414 ms of which 4 ms to minimize.
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:03:12] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:03:13] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 105 places in 381 ms of which 4 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 51 places in 361 ms of which 4 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 103 places in 398 ms of which 4 ms to minimize.
[2024-06-01 14:03:15] [INFO ] Deduced a trap composed of 101 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:03:15] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:03:15] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 61 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 16/16 constraints]
After SMT, in 50432ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 50458ms
Finished structural reductions in LTL mode , in 1 iterations and 50571 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-06-01 14:03:21] [INFO ] Flatten gal took : 114 ms
[2024-06-01 14:03:21] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:03:22] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 144 place count 716 transition count 1988
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 224 place count 676 transition count 1988
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 384 place count 596 transition count 1908
Applied a total of 384 rules in 246 ms. Remains 596 /792 variables (removed 196) and now considering 1908/2100 (removed 192) transitions.
Running 1904 sub problems to find dead transitions.
[2024-06-01 14:03:22] [INFO ] Flow matrix only has 1876 transitions (discarded 32 similar events)
// Phase 1: matrix 1876 rows 596 cols
[2024-06-01 14:03:22] [INFO ] Computed 54 invariants in 51 ms
[2024-06-01 14:03:22] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 14:03:48] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 9 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:03:49] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 285 places in 594 ms of which 7 ms to minimize.
[2024-06-01 14:03:50] [INFO ] Deduced a trap composed of 316 places in 461 ms of which 4 ms to minimize.
[2024-06-01 14:03:51] [INFO ] Deduced a trap composed of 390 places in 433 ms of which 4 ms to minimize.
[2024-06-01 14:03:51] [INFO ] Deduced a trap composed of 299 places in 454 ms of which 4 ms to minimize.
[2024-06-01 14:03:52] [INFO ] Deduced a trap composed of 271 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:03:52] [INFO ] Deduced a trap composed of 275 places in 389 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2472 variables, and 64 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/596 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1904/1904 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1904 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 346 places in 402 ms of which 4 ms to minimize.
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 347 places in 347 ms of which 3 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2472 variables, and 67 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/596 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1904 constraints, Known Traps: 17/17 constraints]
After SMT, in 50825ms problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 50851ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 51103 ms. Remains : 596/792 places, 1908/2100 transitions.
[2024-06-01 14:04:13] [INFO ] Flatten gal took : 123 ms
[2024-06-01 14:04:13] [INFO ] Flatten gal took : 104 ms
[2024-06-01 14:04:13] [INFO ] Input system was already deterministic with 1908 transitions.
RANDOM walk for 113 steps (0 resets) in 13 ms. (8 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 56 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-06-01 14:04:13] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-06-01 14:04:13] [INFO ] Computed 54 invariants in 50 ms
[2024-06-01 14:04:13] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 14:04:42] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 51 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:04:45] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:04:46] [INFO ] Deduced a trap composed of 195 places in 535 ms of which 6 ms to minimize.
[2024-06-01 14:04:47] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:04:48] [INFO ] Deduced a trap composed of 426 places in 470 ms of which 7 ms to minimize.
[2024-06-01 14:04:58] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:04:59] [INFO ] Deduced a trap composed of 384 places in 369 ms of which 4 ms to minimize.
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 445 places in 399 ms of which 5 ms to minimize.
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 445 places in 383 ms of which 4 ms to minimize.
SMT process timed out in 49680ms, After SMT, problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 49711ms
Finished structural reductions in LTL mode , in 1 iterations and 49775 ms. Remains : 780/792 places, 2092/2100 transitions.
[2024-06-01 14:05:03] [INFO ] Flatten gal took : 67 ms
[2024-06-01 14:05:03] [INFO ] Flatten gal took : 73 ms
[2024-06-01 14:05:03] [INFO ] Input system was already deterministic with 2092 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 2068
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 756 transition count 2060
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 748 transition count 2060
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 748 transition count 1980
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 668 transition count 1980
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 248 place count 660 transition count 1972
Iterating global reduction 3 with 8 rules applied. Total rules applied 256 place count 660 transition count 1972
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 612 transition count 1924
Applied a total of 352 rules in 143 ms. Remains 612 /792 variables (removed 180) and now considering 1924/2100 (removed 176) transitions.
Running 1920 sub problems to find dead transitions.
[2024-06-01 14:05:04] [INFO ] Flow matrix only has 1892 transitions (discarded 32 similar events)
// Phase 1: matrix 1892 rows 612 cols
[2024-06-01 14:05:04] [INFO ] Computed 54 invariants in 39 ms
[2024-06-01 14:05:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
[2024-06-01 14:05:28] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:05:29] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:05:32] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2504 variables, and 58 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/612 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1920/1920 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
[2024-06-01 14:05:36] [INFO ] Deduced a trap composed of 320 places in 409 ms of which 5 ms to minimize.
[2024-06-01 14:05:36] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 4 ms to minimize.
[2024-06-01 14:05:37] [INFO ] Deduced a trap composed of 297 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:05:37] [INFO ] Deduced a trap composed of 329 places in 366 ms of which 3 ms to minimize.
[2024-06-01 14:05:37] [INFO ] Deduced a trap composed of 296 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:05:42] [INFO ] Deduced a trap composed of 324 places in 392 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2504 variables, and 64 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/612 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1920 constraints, Known Traps: 14/14 constraints]
After SMT, in 49079ms problems are : Problem set: 0 solved, 1920 unsolved
Search for dead transitions found 0 dead transitions in 49096ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49243 ms. Remains : 612/792 places, 1924/2100 transitions.
[2024-06-01 14:05:53] [INFO ] Flatten gal took : 76 ms
[2024-06-01 14:05:53] [INFO ] Flatten gal took : 86 ms
[2024-06-01 14:05:53] [INFO ] Input system was already deterministic with 1924 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 40 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 14:05:53] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 14:05:53] [INFO ] Computed 54 invariants in 74 ms
[2024-06-01 14:05:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 45 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:06:35] [INFO ] Deduced a trap composed of 82 places in 514 ms of which 5 ms to minimize.
[2024-06-01 14:06:35] [INFO ] Deduced a trap composed of 82 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:06:35] [INFO ] Deduced a trap composed of 51 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:06:36] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:06:36] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:06:36] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:06:36] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:06:37] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 55 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 10/10 constraints]
After SMT, in 51178ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 51204ms
Finished structural reductions in LTL mode , in 1 iterations and 51250 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-06-01 14:06:44] [INFO ] Flatten gal took : 73 ms
[2024-06-01 14:06:44] [INFO ] Flatten gal took : 84 ms
[2024-06-01 14:06:45] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 12 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-06-01 14:06:45] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-06-01 14:06:45] [INFO ] Computed 54 invariants in 80 ms
[2024-06-01 14:06:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 146 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2856 variables, and 51 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/37 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:07:32] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2856 variables, and 57 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/37 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 8/8 constraints]
After SMT, in 49993ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 50017ms
Finished structural reductions in LTL mode , in 1 iterations and 50036 ms. Remains : 788/792 places, 2100/2100 transitions.
[2024-06-01 14:07:35] [INFO ] Flatten gal took : 63 ms
[2024-06-01 14:07:35] [INFO ] Flatten gal took : 74 ms
[2024-06-01 14:07:35] [INFO ] Input system was already deterministic with 2100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 772 transition count 2084
Applied a total of 36 rules in 41 ms. Remains 772 /792 variables (removed 20) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 14:07:35] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 14:07:35] [INFO ] Computed 54 invariants in 61 ms
[2024-06-01 14:07:35] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 334 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 339 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 48 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 4 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 82 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:08:15] [INFO ] Deduced a trap composed of 94 places in 433 ms of which 4 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:08:16] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 105 places in 330 ms of which 3 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 103 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 101 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:08:18] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:08:19] [INFO ] Deduced a trap composed of 41 places in 394 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 61 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/39 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 16/16 constraints]
After SMT, in 49154ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49185ms
Finished structural reductions in LTL mode , in 1 iterations and 49233 ms. Remains : 772/792 places, 2084/2100 transitions.
[2024-06-01 14:08:24] [INFO ] Flatten gal took : 74 ms
[2024-06-01 14:08:24] [INFO ] Flatten gal took : 108 ms
[2024-06-01 14:08:25] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 788 transition count 2036
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 464 place count 556 transition count 1868
Applied a total of 464 rules in 89 ms. Remains 556 /792 variables (removed 236) and now considering 1868/2100 (removed 232) transitions.
Running 1864 sub problems to find dead transitions.
[2024-06-01 14:08:25] [INFO ] Flow matrix only has 1836 transitions (discarded 32 similar events)
// Phase 1: matrix 1836 rows 556 cols
[2024-06-01 14:08:25] [INFO ] Computed 54 invariants in 31 ms
[2024-06-01 14:08:25] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 4 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 256 places in 352 ms of which 5 ms to minimize.
[2024-06-01 14:08:49] [INFO ] Deduced a trap composed of 227 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 272 places in 381 ms of which 4 ms to minimize.
[2024-06-01 14:08:50] [INFO ] Deduced a trap composed of 229 places in 382 ms of which 3 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 261 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 241 places in 341 ms of which 3 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 248 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:08:52] [INFO ] Deduced a trap composed of 243 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:08:53] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 9.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 (/ 1.0 3.0))
(s181 (/ 1.0 3.0))
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 (/ 2.0 3.0))
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/2392 variables, and 66 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/556 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1864/1864 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1864 unsolved
[2024-06-01 14:09:02] [INFO ] Deduced a trap composed of 307 places in 343 ms of which 4 ms to minimize.
[2024-06-01 14:09:03] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 3 ms to minimize.
[2024-06-01 14:09:04] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/2392 variables, and 69 constraints, problems are : Problem set: 0 solved, 1864 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/556 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1864 constraints, Known Traps: 19/19 constraints]
After SMT, in 49644ms problems are : Problem set: 0 solved, 1864 unsolved
Search for dead transitions found 0 dead transitions in 49666ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 49762 ms. Remains : 556/792 places, 1868/2100 transitions.
[2024-06-01 14:09:15] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:09:15] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:09:15] [INFO ] Input system was already deterministic with 1868 transitions.
RANDOM walk for 113 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 548 transition count 1860
Applied a total of 480 rules in 114 ms. Remains 548 /792 variables (removed 244) and now considering 1860/2100 (removed 240) transitions.
Running 1856 sub problems to find dead transitions.
[2024-06-01 14:09:15] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 548 cols
[2024-06-01 14:09:15] [INFO ] Computed 54 invariants in 29 ms
[2024-06-01 14:09:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:09:39] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:09:40] [INFO ] Deduced a trap composed of 229 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:09:40] [INFO ] Deduced a trap composed of 238 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:09:40] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 80 places in 288 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/2376 variables, and 61 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1856/1856 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-06-01 14:09:49] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 292 places in 326 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/2376 variables, and 63 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1856 constraints, Known Traps: 13/13 constraints]
After SMT, in 50314ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 50341ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 50462 ms. Remains : 548/792 places, 1860/2100 transitions.
[2024-06-01 14:10:05] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:10:05] [INFO ] Flatten gal took : 65 ms
[2024-06-01 14:10:06] [INFO ] Input system was already deterministic with 1860 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 128 place count 724 transition count 1932
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 448 place count 564 transition count 1876
Applied a total of 448 rules in 141 ms. Remains 564 /792 variables (removed 228) and now considering 1876/2100 (removed 224) transitions.
Running 1872 sub problems to find dead transitions.
[2024-06-01 14:10:06] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-06-01 14:10:06] [INFO ] Computed 54 invariants in 31 ms
[2024-06-01 14:10:06] [INFO ] State equation strengthened by 160 read => feed constraints.
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 : PolyORBLF-COL-S04J06T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-CTLFireability-2024-15

BK_STOP 1717251015900

--------------------
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 PolyORBLF-COL-S04J06T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1125/ctl_0_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1125/ctl_1_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1125/ctl_2_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1125/ctl_3_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1125/ctl_4_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1125/ctl_5_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1125/ctl_6_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1125/ctl_7_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1125/ctl_8_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1125/ctl_9_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1125/ctl_10_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1125/ctl_11_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1125/ctl_12_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1125/ctl_13_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1125/ctl_14_
ctl formula name PolyORBLF-COL-S04J06T08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1125/ctl_15_
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="PolyORBLF-COL-S04J06T08"
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 PolyORBLF-COL-S04J06T08, 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 r516-tajo-171654446500154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T08.tgz
mv PolyORBLF-COL-S04J06T08 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 ;