Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600289.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 greatspnxred
Input is PolyORBLF-PT-S04J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-PT-S04J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716866793463

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:26:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:26:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:26:35] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2024-05-28 03:26:35] [INFO ] Transformed 618 places.
[2024-05-28 03:26:35] [INFO ] Transformed 3190 transitions.
[2024-05-28 03:26:35] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 397 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Applied a total of 4 rules in 63 ms. Remains 614 /618 variables (removed 4) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2024-05-28 03:26:35] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 614 cols
[2024-05-28 03:26:35] [INFO ] Computed 50 invariants in 99 ms
[2024-05-28 03:26:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-28 03:26:54] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 16 ms to minimize.
[2024-05-28 03:26:57] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2154 variables, and 43 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20090 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-28 03:27:07] [INFO ] Deduced a trap composed of 84 places in 360 ms of which 5 ms to minimize.
[2024-05-28 03:27:08] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 4 ms to minimize.
[2024-05-28 03:27:08] [INFO ] Deduced a trap composed of 83 places in 360 ms of which 4 ms to minimize.
[2024-05-28 03:27:08] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-28 03:27:08] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:27:09] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 4)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 2)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 3)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 4)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 2)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(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 3)
(s219 0)
(s220 0)
(s221 9)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 4)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 2)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 2)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 2)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 4)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 3)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 2)
(s363 0)
(s364 1)
(s365 4)
(s366 0)
(s367 0)
(s368 0)
(s369 4)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 1)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s405 1)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 9)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2154 variables, and 49 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 8/8 constraints]
After SMT, in 45515ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 45564ms
[2024-05-28 03:27:20] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-28 03:27:20] [INFO ] Invariant cache hit.
[2024-05-28 03:27:21] [INFO ] Implicit Places using invariants in 344 ms returned [137, 203, 331, 366, 488, 556]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 366 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/618 places, 1564/1564 transitions.
Applied a total of 0 rules in 26 ms. Remains 608 /608 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46073 ms. Remains : 608/618 places, 1564/1564 transitions.
Support contains 397 out of 608 places after structural reductions.
[2024-05-28 03:27:21] [INFO ] Flatten gal took : 184 ms
[2024-05-28 03:27:21] [INFO ] Flatten gal took : 119 ms
[2024-05-28 03:27:22] [INFO ] Input system was already deterministic with 1564 transitions.
Support contains 396 out of 608 places (down from 397) after GAL structural reductions.
RANDOM walk for 40002 steps (9 resets) in 3876 ms. (10 steps per ms) remains 48/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 113 ms. (35 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 113 ms. (35 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 85 ms. (46 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
[2024-05-28 03:27:24] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 608 cols
[2024-05-28 03:27:24] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 03:27:24] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/328 variables, 16/16 constraints. Problems are: Problem set: 18 solved, 30 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 2/18 constraints. Problems are: Problem set: 20 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/18 constraints. Problems are: Problem set: 20 solved, 28 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 4 (OVERLAPS) 276/604 variables, 23/41 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 03:27:25] [INFO ] Deduced a trap composed of 84 places in 417 ms of which 5 ms to minimize.
[2024-05-28 03:27:25] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 2 ms to minimize.
[2024-05-28 03:27:26] [INFO ] Deduced a trap composed of 84 places in 366 ms of which 4 ms to minimize.
[2024-05-28 03:27:26] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 4/45 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 03:27:26] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 1/46 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/46 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/605 variables, 1/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/606 variables, 1/48 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 03:27:26] [INFO ] Deduced a trap composed of 341 places in 464 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 1/49 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/49 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2146/2148 variables, and 655 constraints, problems are : Problem set: 47 solved, 1 unsolved in 4741 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 606/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 47 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 457/472 variables, 7/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 03:27:29] [INFO ] Deduced a trap composed of 140 places in 276 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/568 variables, 16/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/606 variables, 19/44 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 6/50 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/50 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2146/2148 variables, and 656 constraints, problems are : Problem set: 47 solved, 1 unsolved in 3203 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 606/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 8107ms problems are : Problem set: 47 solved, 1 unsolved
Parikh walk visited 0 properties in 321 ms.
Support contains 3 out of 608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 608 transition count 1512
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 556 transition count 1510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 108 place count 554 transition count 1439
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 250 place count 483 transition count 1439
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 480 transition count 1436
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 480 transition count 1436
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 372 place count 422 transition count 1378
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 384 place count 422 transition count 1366
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 396 place count 410 transition count 1366
Applied a total of 396 rules in 271 ms. Remains 410 /608 variables (removed 198) and now considering 1366/1564 (removed 198) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-28 03:27:32] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 410 cols
[2024-05-28 03:27:33] [INFO ] Computed 44 invariants in 36 ms
[2024-05-28 03:27:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 03:27:48] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-28 03:27:48] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2024-05-28 03:27:48] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-28 03:27:48] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2024-05-28 03:27:55] [INFO ] Deduced a trap composed of 130 places in 220 ms of which 2 ms to minimize.
[2024-05-28 03:27:55] [INFO ] Deduced a trap composed of 128 places in 235 ms of which 3 ms to minimize.
[2024-05-28 03:27:56] [INFO ] Deduced a trap composed of 110 places in 246 ms of which 4 ms to minimize.
[2024-05-28 03:27:57] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1752 variables, and 47 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 03:28:02] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-05-28 03:28:02] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:28:06] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-28 03:28:06] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:28:06] [INFO ] Deduced a trap composed of 130 places in 345 ms of which 3 ms to minimize.
[2024-05-28 03:28:06] [INFO ] Deduced a trap composed of 131 places in 272 ms of which 3 ms to minimize.
[2024-05-28 03:28:07] [INFO ] Deduced a trap composed of 130 places in 302 ms of which 3 ms to minimize.
[2024-05-28 03:28:07] [INFO ] Deduced a trap composed of 129 places in 310 ms of which 3 ms to minimize.
[2024-05-28 03:28:07] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 03:28:07] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1752 variables, and 57 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 18/18 constraints]
After SMT, in 47390ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 47410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47687 ms. Remains : 410/608 places, 1366/1564 transitions.
RANDOM walk for 40000 steps (11 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 179325 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 179325 steps, saw 127036 distinct states, run finished after 3007 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-28 03:28:23] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 03:28:23] [INFO ] Invariant cache hit.
[2024-05-28 03:28:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 158/168 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/283 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/295 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/407 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:28:24] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 3 ms to minimize.
[2024-05-28 03:28:24] [INFO ] Deduced a trap composed of 132 places in 272 ms of which 2 ms to minimize.
[2024-05-28 03:28:24] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/408 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1750/1752 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6208 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 408/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/168 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/283 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/295 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/407 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:28:30] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-28 03:28:30] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-05-28 03:28:30] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:28:30] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/408 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1752 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 408/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 51238ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1366/1366 transitions.
Applied a total of 0 rules in 78 ms. Remains 410 /410 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 410/410 places, 1366/1366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1366/1366 transitions.
Applied a total of 0 rules in 54 ms. Remains 410 /410 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
[2024-05-28 03:29:14] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 03:29:14] [INFO ] Invariant cache hit.
[2024-05-28 03:29:15] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-28 03:29:15] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 03:29:15] [INFO ] Invariant cache hit.
[2024-05-28 03:29:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:29:25] [INFO ] Implicit Places using invariants and state equation in 9998 ms returned []
Implicit Place search using SMT with State Equation took 10590 ms to find 0 implicit places.
[2024-05-28 03:29:25] [INFO ] Redundant transitions in 72 ms returned []
Running 1362 sub problems to find dead transitions.
[2024-05-28 03:29:25] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-28 03:29:25] [INFO ] Invariant cache hit.
[2024-05-28 03:29:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 03:29:42] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2024-05-28 03:29:42] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-28 03:29:42] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 2 ms to minimize.
[2024-05-28 03:29:49] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 2 ms to minimize.
[2024-05-28 03:29:50] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2024-05-28 03:29:50] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 1 ms to minimize.
[2024-05-28 03:29:50] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 03:29:56] [INFO ] Deduced a trap composed of 136 places in 253 ms of which 3 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 406/1752 variables, and 47 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 03:30:05] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:30:05] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2024-05-28 03:30:05] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-28 03:30:07] [INFO ] Deduced a trap composed of 129 places in 280 ms of which 2 ms to minimize.
[2024-05-28 03:30:08] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-28 03:30:08] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-28 03:30:16] [INFO ] Deduced a trap composed of 110 places in 278 ms of which 3 ms to minimize.
[2024-05-28 03:30:21] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
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 406/1752 variables, and 55 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 16/16 constraints]
After SMT, in 67732ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 67747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78478 ms. Remains : 410/410 places, 1366/1366 transitions.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:30:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 03:30:33] [INFO ] Flatten gal took : 180 ms
[2024-05-28 03:30:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:30:33] [INFO ] Flatten gal took : 181 ms
[2024-05-28 03:30:34] [INFO ] Input system was already deterministic with 1564 transitions.
Support contains 57 out of 608 places (down from 153) after GAL structural reductions.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 608 transition count 1522
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 566 transition count 1510
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 108 place count 554 transition count 1444
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 240 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 348 place count 434 transition count 1390
Applied a total of 348 rules in 200 ms. Remains 434 /608 variables (removed 174) and now considering 1390/1564 (removed 174) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-28 03:30:34] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-05-28 03:30:34] [INFO ] Computed 44 invariants in 58 ms
[2024-05-28 03:30:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 03:30:48] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:30:49] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 37 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-28 03:31:02] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 2 ms to minimize.
[2024-05-28 03:31:02] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 2 ms to minimize.
[2024-05-28 03:31:02] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 2 ms to minimize.
[2024-05-28 03:31:02] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:31:02] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-28 03:31:03] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 43 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 8/8 constraints]
After SMT, in 45613ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 45661ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45879 ms. Remains : 434/608 places, 1390/1564 transitions.
[2024-05-28 03:31:20] [INFO ] Flatten gal took : 68 ms
[2024-05-28 03:31:20] [INFO ] Flatten gal took : 73 ms
[2024-05-28 03:31:20] [INFO ] Input system was already deterministic with 1390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 608 transition count 1522
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 566 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 560 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 560 transition count 1444
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 488 transition count 1444
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 485 transition count 1441
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 485 transition count 1441
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 282 place count 467 transition count 1423
Applied a total of 282 rules in 85 ms. Remains 467 /608 variables (removed 141) and now considering 1423/1564 (removed 141) transitions.
Running 1419 sub problems to find dead transitions.
[2024-05-28 03:31:20] [INFO ] Flow matrix only has 1399 transitions (discarded 24 similar events)
// Phase 1: matrix 1399 rows 467 cols
[2024-05-28 03:31:20] [INFO ] Computed 44 invariants in 62 ms
[2024-05-28 03:31:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
[2024-05-28 03:31:35] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 3 ms to minimize.
[2024-05-28 03:31:35] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-28 03:31:35] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2024-05-28 03:31:36] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 2 ms to minimize.
[2024-05-28 03:31:36] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 2 ms to minimize.
[2024-05-28 03:31:36] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 0 ms to minimize.
[2024-05-28 03:31:36] [INFO ] Deduced a trap composed of 238 places in 324 ms of which 3 ms to minimize.
[2024-05-28 03:31:37] [INFO ] Deduced a trap composed of 60 places in 304 ms of which 3 ms to minimize.
[2024-05-28 03:31:37] [INFO ] Deduced a trap composed of 223 places in 300 ms of which 2 ms to minimize.
[2024-05-28 03:31:37] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 4 ms to minimize.
[2024-05-28 03:31:38] [INFO ] Deduced a trap composed of 218 places in 304 ms of which 3 ms to minimize.
[2024-05-28 03:31:38] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-28 03:31:39] [INFO ] Deduced a trap composed of 174 places in 337 ms of which 4 ms to minimize.
[2024-05-28 03:31:40] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 3 ms to minimize.
[2024-05-28 03:31:40] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 3 ms to minimize.
[2024-05-28 03:31:43] [INFO ] Deduced a trap composed of 193 places in 309 ms of which 4 ms to minimize.
[2024-05-28 03:31:43] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-05-28 03:31:44] [INFO ] Deduced a trap composed of 179 places in 328 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1866 variables, and 58 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/467 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1419/1419 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1866 variables, and 58 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/467 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1419 constraints, Known Traps: 18/18 constraints]
After SMT, in 45860ms problems are : Problem set: 0 solved, 1419 unsolved
Search for dead transitions found 0 dead transitions in 45876ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45964 ms. Remains : 467/608 places, 1423/1564 transitions.
[2024-05-28 03:32:06] [INFO ] Flatten gal took : 61 ms
[2024-05-28 03:32:06] [INFO ] Flatten gal took : 65 ms
[2024-05-28 03:32:06] [INFO ] Input system was already deterministic with 1423 transitions.
RANDOM walk for 69 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 27 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:32:06] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:32:06] [INFO ] Computed 44 invariants in 49 ms
[2024-05-28 03:32:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:32:26] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-28 03:32:26] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-05-28 03:32:26] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-05-28 03:32:26] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:32:26] [INFO ] Deduced a trap composed of 98 places in 357 ms of which 4 ms to minimize.
[2024-05-28 03:32:27] [INFO ] Deduced a trap composed of 133 places in 340 ms of which 4 ms to minimize.
[2024-05-28 03:32:27] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 2 ms to minimize.
[2024-05-28 03:32:27] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-28 03:32:27] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:32:28] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 2 ms to minimize.
[2024-05-28 03:32:29] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 3 ms to minimize.
[2024-05-28 03:32:30] [INFO ] Deduced a trap composed of 282 places in 342 ms of which 5 ms to minimize.
[2024-05-28 03:32:31] [INFO ] Deduced a trap composed of 310 places in 385 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 53 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:32:48] [INFO ] Deduced a trap composed of 325 places in 415 ms of which 5 ms to minimize.
[2024-05-28 03:32:49] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 4 ms to minimize.
[2024-05-28 03:32:50] [INFO ] Deduced a trap composed of 265 places in 331 ms of which 3 ms to minimize.
[2024-05-28 03:32:51] [INFO ] Deduced a trap composed of 308 places in 376 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 17/17 constraints]
After SMT, in 46322ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46337ms
Finished structural reductions in LTL mode , in 1 iterations and 46368 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-05-28 03:32:53] [INFO ] Flatten gal took : 57 ms
[2024-05-28 03:32:53] [INFO ] Flatten gal took : 62 ms
[2024-05-28 03:32:53] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1510
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1438
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 252 place count 482 transition count 1438
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1435
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1435
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 378 place count 419 transition count 1375
Applied a total of 378 rules in 81 ms. Remains 419 /608 variables (removed 189) and now considering 1375/1564 (removed 189) transitions.
Running 1371 sub problems to find dead transitions.
[2024-05-28 03:32:53] [INFO ] Flow matrix only has 1351 transitions (discarded 24 similar events)
// Phase 1: matrix 1351 rows 419 cols
[2024-05-28 03:32:53] [INFO ] Computed 44 invariants in 48 ms
[2024-05-28 03:32:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2024-05-28 03:33:08] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 3 ms to minimize.
[2024-05-28 03:33:08] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 2 ms to minimize.
[2024-05-28 03:33:09] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 2 ms to minimize.
[2024-05-28 03:33:09] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
[2024-05-28 03:33:09] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:33:09] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-28 03:33:10] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 6 ms to minimize.
[2024-05-28 03:33:10] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 6 ms to minimize.
[2024-05-28 03:33:10] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-28 03:33:11] [INFO ] Deduced a trap composed of 132 places in 350 ms of which 2 ms to minimize.
[2024-05-28 03:33:12] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2024-05-28 03:33:14] [INFO ] Deduced a trap composed of 180 places in 442 ms of which 3 ms to minimize.
[2024-05-28 03:33:15] [INFO ] Deduced a trap composed of 184 places in 334 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1770 variables, and 53 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/419 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2024-05-28 03:33:31] [INFO ] Deduced a trap composed of 223 places in 311 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1770 variables, and 54 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/419 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 14/14 constraints]
After SMT, in 46161ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 46183ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46270 ms. Remains : 419/608 places, 1375/1564 transitions.
[2024-05-28 03:33:39] [INFO ] Flatten gal took : 91 ms
[2024-05-28 03:33:39] [INFO ] Flatten gal took : 75 ms
[2024-05-28 03:33:39] [INFO ] Input system was already deterministic with 1375 transitions.
RANDOM walk for 150 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 31 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:33:39] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:33:39] [INFO ] Computed 44 invariants in 46 ms
[2024-05-28 03:33:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:33:59] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 2 ms to minimize.
[2024-05-28 03:33:59] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2024-05-28 03:34:00] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-28 03:34:00] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-28 03:34:00] [INFO ] Deduced a trap composed of 98 places in 361 ms of which 4 ms to minimize.
[2024-05-28 03:34:01] [INFO ] Deduced a trap composed of 133 places in 381 ms of which 4 ms to minimize.
[2024-05-28 03:34:01] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 3 ms to minimize.
[2024-05-28 03:34:01] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-28 03:34:01] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-28 03:34:02] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 3 ms to minimize.
[2024-05-28 03:34:03] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 2 ms to minimize.
[2024-05-28 03:34:04] [INFO ] Deduced a trap composed of 282 places in 474 ms of which 4 ms to minimize.
[2024-05-28 03:34:05] [INFO ] Deduced a trap composed of 310 places in 429 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 53 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:34:21] [INFO ] Deduced a trap composed of 325 places in 499 ms of which 5 ms to minimize.
[2024-05-28 03:34:23] [INFO ] Deduced a trap composed of 42 places in 672 ms of which 6 ms to minimize.
[2024-05-28 03:34:25] [INFO ] Deduced a trap composed of 265 places in 430 ms of which 5 ms to minimize.
[2024-05-28 03:34:25] [INFO ] Deduced a trap composed of 308 places in 383 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 17/17 constraints]
After SMT, in 46863ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46884ms
Finished structural reductions in LTL mode , in 1 iterations and 46929 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-05-28 03:34:26] [INFO ] Flatten gal took : 72 ms
[2024-05-28 03:34:26] [INFO ] Flatten gal took : 64 ms
[2024-05-28 03:34:27] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 608 transition count 1512
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 556 transition count 1510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 108 place count 554 transition count 1439
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 250 place count 483 transition count 1439
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 480 transition count 1436
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 480 transition count 1436
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 372 place count 422 transition count 1378
Applied a total of 372 rules in 143 ms. Remains 422 /608 variables (removed 186) and now considering 1378/1564 (removed 186) transitions.
Running 1374 sub problems to find dead transitions.
[2024-05-28 03:34:27] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-05-28 03:34:27] [INFO ] Computed 44 invariants in 43 ms
[2024-05-28 03:34:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 03:34:41] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-28 03:34:42] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1776 variables, and 37 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 03:34:59] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 3 ms to minimize.
[2024-05-28 03:34:59] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 2 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 2 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:35:00] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:35:02] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 2 ms to minimize.
[2024-05-28 03:35:02] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-28 03:35:08] [INFO ] Deduced a trap composed of 135 places in 320 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 45 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 10/10 constraints]
After SMT, in 46332ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 46351ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46499 ms. Remains : 422/608 places, 1378/1564 transitions.
[2024-05-28 03:35:13] [INFO ] Flatten gal took : 58 ms
[2024-05-28 03:35:13] [INFO ] Flatten gal took : 60 ms
[2024-05-28 03:35:13] [INFO ] Input system was already deterministic with 1378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 28 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:35:13] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:35:13] [INFO ] Computed 44 invariants in 31 ms
[2024-05-28 03:35:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:35:33] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-05-28 03:35:34] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-28 03:35:34] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 4 ms to minimize.
[2024-05-28 03:35:34] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:35:34] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 4 ms to minimize.
[2024-05-28 03:35:35] [INFO ] Deduced a trap composed of 133 places in 449 ms of which 32 ms to minimize.
[2024-05-28 03:35:35] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 6 ms to minimize.
[2024-05-28 03:35:35] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 1 ms to minimize.
[2024-05-28 03:35:35] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:35:37] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 2 ms to minimize.
[2024-05-28 03:35:37] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:35:38] [INFO ] Deduced a trap composed of 282 places in 481 ms of which 4 ms to minimize.
[2024-05-28 03:35:39] [INFO ] Deduced a trap composed of 310 places in 537 ms of which 18 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 (/ 37.0 4.0))
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.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)
(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 (/ 3.0 4.0))
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 53 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:35:55] [INFO ] Deduced a trap composed of 325 places in 533 ms of which 4 ms to minimize.
[2024-05-28 03:35:56] [INFO ] Deduced a trap composed of 42 places in 536 ms of which 4 ms to minimize.
[2024-05-28 03:35:58] [INFO ] Deduced a trap composed of 265 places in 395 ms of which 4 ms to minimize.
[2024-05-28 03:35:59] [INFO ] Deduced a trap composed of 308 places in 476 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 17/17 constraints]
After SMT, in 46847ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46868ms
Finished structural reductions in LTL mode , in 1 iterations and 46901 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-05-28 03:36:00] [INFO ] Flatten gal took : 86 ms
[2024-05-28 03:36:00] [INFO ] Flatten gal took : 83 ms
[2024-05-28 03:36:01] [INFO ] Input system was already deterministic with 1552 transitions.
[2024-05-28 03:36:01] [INFO ] Flatten gal took : 63 ms
[2024-05-28 03:36:01] [INFO ] Flatten gal took : 64 ms
[2024-05-28 03:36:01] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 03:36:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 608 places, 1564 transitions and 7772 arcs took 19 ms.
Total runtime 566561 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 608
TRANSITIONS: 1564
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.010s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1151
MODEL NAME: /home/mcc/execution/414/model
608 places, 1564 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-PT-S04J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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