About the Execution of GreatSPN+red for BART-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2880.644 | 3600000.00 | 3848596.00 | 10931.70 | F?TFFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166700468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BART-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166700468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 54M
-rw-r--r-- 1 mcc users 1.2M Apr 12 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.1M Apr 12 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M Apr 12 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 604K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 685K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 9.2M Apr 13 02:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4M Apr 13 00:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 00:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 136K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-020-LTLFireability-00
FORMULA_NAME BART-PT-020-LTLFireability-01
FORMULA_NAME BART-PT-020-LTLFireability-02
FORMULA_NAME BART-PT-020-LTLFireability-03
FORMULA_NAME BART-PT-020-LTLFireability-04
FORMULA_NAME BART-PT-020-LTLFireability-05
FORMULA_NAME BART-PT-020-LTLFireability-06
FORMULA_NAME BART-PT-020-LTLFireability-07
FORMULA_NAME BART-PT-020-LTLFireability-08
FORMULA_NAME BART-PT-020-LTLFireability-09
FORMULA_NAME BART-PT-020-LTLFireability-10
FORMULA_NAME BART-PT-020-LTLFireability-11
FORMULA_NAME BART-PT-020-LTLFireability-12
FORMULA_NAME BART-PT-020-LTLFireability-13
FORMULA_NAME BART-PT-020-LTLFireability-14
FORMULA_NAME BART-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716380888677
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 12:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:28:11] [INFO ] Load time of PNML (sax parser for PT used): 774 ms
[2024-05-22 12:28:11] [INFO ] Transformed 2850 places.
[2024-05-22 12:28:11] [INFO ] Transformed 4040 transitions.
[2024-05-22 12:28:11] [INFO ] Found NUPN structural information;
[2024-05-22 12:28:11] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 1047 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 115 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2621 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 51 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2024-05-22 12:28:12] [INFO ] Computed 20 invariants in 89 ms
[2024-05-22 12:28:13] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-05-22 12:28:13] [INFO ] Invariant cache hit.
[2024-05-22 12:28:16] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3929 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2024-05-22 12:28:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30144 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30057 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints]
After SMT, in 62147ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 62328ms
Finished structural reductions in LTL mode , in 1 iterations and 66355 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2621 out of 2640 places after structural reductions.
[2024-05-22 12:29:19] [INFO ] Flatten gal took : 417 ms
[2024-05-22 12:29:20] [INFO ] Flatten gal took : 225 ms
[2024-05-22 12:29:20] [INFO ] Input system was already deterministic with 4040 transitions.
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (8 resets) in 2997 ms. (13 steps per ms) remains 1/13 properties
BEST_FIRST walk for 33763 steps (6 resets) in 2636 ms. (12 steps per ms) remains 0/1 properties
FORMULA BART-PT-020-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 180 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3560 edges and 2640 vertex of which 820 / 2640 are part of one of the 20 SCC in 13 ms
Free SCC test removed 800 places
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1120 transitions
Trivial Post-agglo rules discarded 1120 transitions
Performed 1120 trivial Post agglomeration. Transition count delta: 1120
Iterating post reduction 0 with 1120 rules applied. Total rules applied 1121 place count 1840 transition count 1420
Reduce places removed 1120 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 1 with 1360 rules applied. Total rules applied 2481 place count 720 transition count 1180
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 2 with 240 rules applied. Total rules applied 2721 place count 640 transition count 1020
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 3 with 240 rules applied. Total rules applied 2961 place count 560 transition count 860
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 160 rules applied. Total rules applied 3121 place count 480 transition count 780
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 3221 place count 380 transition count 680
Iterating global reduction 5 with 100 rules applied. Total rules applied 3321 place count 380 transition count 680
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 3421 place count 380 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 3441 place count 380 transition count 560
Applied a total of 3441 rules in 212 ms. Remains 380 /2640 variables (removed 2260) and now considering 560/4040 (removed 3480) transitions.
[2024-05-22 12:29:23] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
// Phase 1: matrix 541 rows 380 cols
[2024-05-22 12:29:23] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 12:29:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-22 12:29:23] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
[2024-05-22 12:29:23] [INFO ] Invariant cache hit.
[2024-05-22 12:29:23] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-22 12:29:23] [INFO ] Redundant transitions in 38 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-22 12:29:23] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
[2024-05-22 12:29:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 20/380 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 540/920 variables, 380/400 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 0/920 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/921 variables, and 400 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21518 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 20/380 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 540/920 variables, 380/400 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/920 variables, 360/760 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/920 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/920 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/921 variables, and 760 constraints, problems are : Problem set: 0 solved, 360 unsolved in 15358 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 36958ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 36966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 380/2640 places, 560/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37619 ms. Remains : 380/2640 places, 560/4040 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA BART-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-00 finished in 37938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1360 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 540
Iterating post reduction 1 with 600 rules applied. Total rules applied 660 place count 2580 transition count 3440
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 2 with 540 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 2020 transition count 3420
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1400 place count 1940 transition count 3340
Applied a total of 1400 rules in 717 ms. Remains 1940 /2640 variables (removed 700) and now considering 3340/4040 (removed 700) transitions.
// Phase 1: matrix 3340 rows 1940 cols
[2024-05-22 12:30:01] [INFO ] Computed 20 invariants in 28 ms
[2024-05-22 12:30:01] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-22 12:30:01] [INFO ] Invariant cache hit.
[2024-05-22 12:30:03] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2024-05-22 12:30:03] [INFO ] Redundant transitions in 279 ms returned []
Running 2620 sub problems to find dead transitions.
[2024-05-22 12:30:03] [INFO ] Invariant cache hit.
(s919 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 2620/2620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 0/2620 constraints, Known Traps: 0/0 constraints]
After SMT, in 61247ms problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1940/2640 places, 3340/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64534 ms. Remains : 1940/2640 places, 3340/4040 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 1600 ms.
Product exploration explored 100000 steps with 0 reset in 1496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 10 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-22 12:31:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 103 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2024-05-22 12:31:27] [INFO ] Invariant cache hit.
[2024-05-22 12:31:27] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 12:31:27] [INFO ] Invariant cache hit.
[2024-05-22 12:31:29] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2024-05-22 12:31:29] [INFO ] Redundant transitions in 125 ms returned []
Running 2620 sub problems to find dead transitions.
[2024-05-22 12:31:29] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 2620/2620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2620 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 0/2620 constraints, Known Traps: 0/0 constraints]
After SMT, in 61113ms problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 61145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63352 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 10 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-22 12:32:33] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1489 ms.
Product exploration explored 100000 steps with 0 reset in 1523 ms.
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 54 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2024-05-22 12:32:51] [INFO ] Invariant cache hit.
[2024-05-22 12:32:52] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-22 12:32:52] [INFO ] Invariant cache hit.
[2024-05-22 12:32:53] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2024-05-22 12:32:53] [INFO ] Redundant transitions in 123 ms returned []
Running 2620 sub problems to find dead transitions.
[2024-05-22 12:32:53] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 2620/2620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2620 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 0/2620 constraints, Known Traps: 0/0 constraints]
After SMT, in 61113ms problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 61138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63311 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Treatment of property BART-PT-020-LTLFireability-01 finished in 235060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!p0)) U G(p1)) U X(X(p2))))'
Support contains 2440 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 26 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2024-05-22 12:33:55] [INFO ] Computed 20 invariants in 22 ms
[2024-05-22 12:33:56] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-22 12:33:56] [INFO ] Invariant cache hit.
[2024-05-22 12:33:59] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2024-05-22 12:33:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30103 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30109 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints]
After SMT, in 62158ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 62191ms
Finished structural reductions in LTL mode , in 1 iterations and 65552 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 527 ms :[(NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), p0, (AND p0 p1), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-02
Product exploration timeout after 97520 steps with 32647 reset in 10003 ms.
Product exploration explored 100000 steps with 33483 reset in 9607 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 31 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-02 finished in 170663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1280 transitions
Trivial Post-agglo rules discarded 1280 transitions
Performed 1280 trivial Post agglomeration. Transition count delta: 1280
Iterating post reduction 0 with 1280 rules applied. Total rules applied 1280 place count 2640 transition count 2760
Reduce places removed 1280 places and 0 transitions.
Iterating post reduction 1 with 1280 rules applied. Total rules applied 2560 place count 1360 transition count 2760
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 2560 place count 1360 transition count 2680
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2720 place count 1280 transition count 2680
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 2840 place count 1160 transition count 2560
Iterating global reduction 2 with 120 rules applied. Total rules applied 2960 place count 1160 transition count 2560
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2980 place count 1160 transition count 2540
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 3060 place count 1080 transition count 2460
Iterating global reduction 3 with 80 rules applied. Total rules applied 3140 place count 1080 transition count 2460
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3200 place count 1020 transition count 2400
Iterating global reduction 3 with 60 rules applied. Total rules applied 3260 place count 1020 transition count 2400
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3320 place count 960 transition count 2340
Iterating global reduction 3 with 60 rules applied. Total rules applied 3380 place count 960 transition count 2340
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 3420 place count 920 transition count 2300
Iterating global reduction 3 with 40 rules applied. Total rules applied 3460 place count 920 transition count 2300
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 3500 place count 880 transition count 2260
Iterating global reduction 3 with 40 rules applied. Total rules applied 3540 place count 880 transition count 2260
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 3560 place count 860 transition count 2240
Iterating global reduction 3 with 20 rules applied. Total rules applied 3580 place count 860 transition count 2240
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 3860 place count 720 transition count 2100
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 3940 place count 720 transition count 2020
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 4020 place count 680 transition count 1980
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 4100 place count 680 transition count 1900
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4180 place count 640 transition count 1860
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 5 with 80 rules applied. Total rules applied 4260 place count 640 transition count 1780
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4340 place count 600 transition count 1740
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 6 with 80 rules applied. Total rules applied 4420 place count 600 transition count 1660
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4500 place count 560 transition count 1620
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 7 with 80 rules applied. Total rules applied 4580 place count 560 transition count 1540
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 4660 place count 520 transition count 1500
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 8 with 80 rules applied. Total rules applied 4740 place count 520 transition count 1420
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 4820 place count 480 transition count 1380
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 9 with 80 rules applied. Total rules applied 4900 place count 480 transition count 1300
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 4980 place count 440 transition count 1260
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 10 with 80 rules applied. Total rules applied 5060 place count 440 transition count 1180
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 11 with 80 rules applied. Total rules applied 5140 place count 400 transition count 1140
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 11 with 80 rules applied. Total rules applied 5220 place count 400 transition count 1060
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 12 with 80 rules applied. Total rules applied 5300 place count 360 transition count 1020
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 12 with 80 rules applied. Total rules applied 5380 place count 360 transition count 940
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 13 with 80 rules applied. Total rules applied 5460 place count 320 transition count 900
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 13 with 80 rules applied. Total rules applied 5540 place count 320 transition count 820
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 14 with 80 rules applied. Total rules applied 5620 place count 280 transition count 780
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 14 with 80 rules applied. Total rules applied 5700 place count 280 transition count 700
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 15 with 80 rules applied. Total rules applied 5780 place count 240 transition count 660
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 15 with 80 rules applied. Total rules applied 5860 place count 240 transition count 580
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 16 with 80 rules applied. Total rules applied 5940 place count 200 transition count 540
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 16 with 80 rules applied. Total rules applied 6020 place count 200 transition count 460
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 17 with 80 rules applied. Total rules applied 6100 place count 160 transition count 420
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 17 with 80 rules applied. Total rules applied 6180 place count 160 transition count 340
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 18 with 80 rules applied. Total rules applied 6260 place count 120 transition count 300
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 18 with 80 rules applied. Total rules applied 6340 place count 120 transition count 220
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 19 with 80 rules applied. Total rules applied 6420 place count 80 transition count 180
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 19 with 100 rules applied. Total rules applied 6520 place count 80 transition count 80
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 20 with 40 rules applied. Total rules applied 6560 place count 60 transition count 60
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 20 Pre rules applied. Total rules applied 6560 place count 60 transition count 40
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 21 with 40 rules applied. Total rules applied 6600 place count 40 transition count 40
Applied a total of 6600 rules in 1099 ms. Remains 40 /2640 variables (removed 2600) and now considering 40/4040 (removed 4000) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-22 12:36:47] [INFO ] Computed 20 invariants in 0 ms
[2024-05-22 12:36:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 12:36:47] [INFO ] Invariant cache hit.
[2024-05-22 12:36:47] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-22 12:36:47] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 12:36:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/40 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 40/80 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 20/40 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 40/80 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 80 constraints, problems are : Problem set: 0 solved, 20 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/2640 places, 40/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1868 ms. Remains : 40/2640 places, 40/4040 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 219 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 2159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&F(!p1)))))))'
Support contains 1940 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 520 edges and 2640 vertex of which 120 / 2640 are part of one of the 20 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 2540 transition count 3780
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 2380 transition count 3780
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 0 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 801 place count 2140 transition count 3540
Applied a total of 801 rules in 195 ms. Remains 2140 /2640 variables (removed 500) and now considering 3540/4040 (removed 500) transitions.
[2024-05-22 12:36:48] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
// Phase 1: matrix 3521 rows 2140 cols
[2024-05-22 12:36:48] [INFO ] Computed 20 invariants in 17 ms
[2024-05-22 12:36:49] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-22 12:36:49] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
[2024-05-22 12:36:49] [INFO ] Invariant cache hit.
[2024-05-22 12:36:51] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
[2024-05-22 12:36:51] [INFO ] Redundant transitions in 142 ms returned []
Running 2820 sub problems to find dead transitions.
[2024-05-22 12:36:52] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
[2024-05-22 12:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 2120/2120 constraints. Problems are: Problem set: 0 solved, 2820 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/5661 variables, and 2120 constraints, problems are : Problem set: 0 solved, 2820 unsolved in 30051 ms.
Refiners :[Domain max(s): 2120/2140 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2140 constraints, PredecessorRefiner: 2820/2820 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2820 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 2120/2120 constraints. Problems are: Problem set: 0 solved, 2820 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/5661 variables, and 2120 constraints, problems are : Problem set: 0 solved, 2820 unsolved in 30052 ms.
Refiners :[Domain max(s): 2120/2140 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2140 constraints, PredecessorRefiner: 0/2820 constraints, Known Traps: 0/0 constraints]
After SMT, in 61374ms problems are : Problem set: 0 solved, 2820 unsolved
Search for dead transitions found 0 dead transitions in 61401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2140/2640 places, 3540/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64807 ms. Remains : 2140/2640 places, 3540/4040 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-04
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 4 ms.
FORMULA BART-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-04 finished in 64956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 180 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 460 places :
Symmetric choice reduction at 0 with 460 rule applications. Total rules 460 place count 2180 transition count 3580
Iterating global reduction 0 with 460 rules applied. Total rules applied 920 place count 2180 transition count 3580
Discarding 380 places :
Symmetric choice reduction at 0 with 380 rule applications. Total rules 1300 place count 1800 transition count 3200
Iterating global reduction 0 with 380 rules applied. Total rules applied 1680 place count 1800 transition count 3200
Applied a total of 1680 rules in 264 ms. Remains 1800 /2640 variables (removed 840) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2024-05-22 12:37:53] [INFO ] Computed 20 invariants in 16 ms
[2024-05-22 12:37:54] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-22 12:37:54] [INFO ] Invariant cache hit.
[2024-05-22 12:37:55] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Running 2480 sub problems to find dead transitions.
[2024-05-22 12:37:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1780/5000 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 2480/2480 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1780/5000 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 0/2480 constraints, Known Traps: 0/0 constraints]
After SMT, in 61078ms problems are : Problem set: 0 solved, 2480 unsolved
Search for dead transitions found 0 dead transitions in 61102ms
Starting structural reductions in LTL mode, iteration 1 : 1800/2640 places, 3200/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63256 ms. Remains : 1800/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-05
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 5 ms.
FORMULA BART-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-05 finished in 63370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3056 place count 1082 transition count 2482
Iterating global reduction 0 with 60 rules applied. Total rules applied 3116 place count 1082 transition count 2482
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3156 place count 1042 transition count 2442
Iterating global reduction 0 with 40 rules applied. Total rules applied 3196 place count 1042 transition count 2442
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3236 place count 1002 transition count 2402
Iterating global reduction 0 with 40 rules applied. Total rules applied 3276 place count 1002 transition count 2402
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3296 place count 982 transition count 2382
Iterating global reduction 0 with 20 rules applied. Total rules applied 3316 place count 982 transition count 2382
Applied a total of 3316 rules in 1179 ms. Remains 982 /2640 variables (removed 1658) and now considering 2382/4040 (removed 1658) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2024-05-22 12:38:58] [INFO ] Computed 20 invariants in 11 ms
[2024-05-22 12:38:58] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 12:38:58] [INFO ] Invariant cache hit.
[2024-05-22 12:38:59] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 1662 sub problems to find dead transitions.
[2024-05-22 12:38:59] [INFO ] Invariant cache hit.
(s154 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 1662 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/982 constraints, PredecessorRefiner: 1662/1662 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1662 unsolved
At refinement iteration 1 (OVERLAPS) 20/982 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/3364 variables, and 20 constraints, problems are : Problem set: 0 solved, 1662 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/982 constraints, PredecessorRefiner: 0/1662 constraints, Known Traps: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 1662 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 982/2640 places, 2382/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62988 ms. Remains : 982/2640 places, 2382/4040 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BART-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 522 ms.
Product exploration explored 100000 steps with 0 reset in 611 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 9 factoid took 724 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 33287 steps (6 resets) in 399 ms. (83 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 1107 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2024-05-22 12:40:03] [INFO ] Invariant cache hit.
[2024-05-22 12:40:04] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 9 factoid took 1052 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-09 finished in 69166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 705 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2024-05-22 12:40:06] [INFO ] Computed 20 invariants in 7 ms
[2024-05-22 12:40:06] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 12:40:06] [INFO ] Invariant cache hit.
[2024-05-22 12:40:07] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-22 12:40:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62376 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 435 steps with 0 reset in 4 ms.
FORMULA BART-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-10 finished in 62494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4038 edges and 2640 vertex of which 2508 / 2640 are part of one of the 19 SCC in 3 ms
Free SCC test removed 2489 places
Ensure Unique test removed 3819 transitions
Reduce isomorphic transitions removed 3819 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
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 82 rules applied. Total rules applied 83 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 147 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 147 place count 68 transition count 135
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 190 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 194 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 212 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 216 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 224 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 232 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 236 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 240 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 244 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 248 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 252 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 256 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 260 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 264 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 268 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 272 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 276 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 280 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 284 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 288 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 292 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 296 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 300 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 304 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 308 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 312 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 316 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 320 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 324 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 328 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 332 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 336 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 340 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 345 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 347 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 347 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 349 place count 2 transition count 3
Applied a total of 349 rules in 54 ms. Remains 2 /2640 variables (removed 2638) and now considering 3/4040 (removed 4037) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 12:41:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:41:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 12:41:08] [INFO ] Invariant cache hit.
[2024-05-22 12:41:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 12:41:08] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 12:41:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 48ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2640 places, 3/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 2/2640 places, 3/4040 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-14 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4036 edges and 2640 vertex of which 2637 / 2640 are part of one of the 20 SCC in 1 ms
Free SCC test removed 2617 places
Ensure Unique test removed 4015 transitions
Reduce isomorphic transitions removed 4015 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 3 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 2 transition count 3
Applied a total of 25 rules in 8 ms. Remains 2 /2640 variables (removed 2638) and now considering 3/4040 (removed 4037) transitions.
[2024-05-22 12:41:08] [INFO ] Invariant cache hit.
[2024-05-22 12:41:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 12:41:08] [INFO ] Invariant cache hit.
[2024-05-22 12:41:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-22 12:41:08] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 12:41:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2640 places, 3/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 2/2640 places, 3/4040 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-15 finished in 177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-22 12:41:09] [INFO ] Flatten gal took : 109 ms
[2024-05-22 12:41:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2024-05-22 12:41:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2640 places, 4040 transitions and 8080 arcs took 22 ms.
Total runtime 778756 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BART-PT-020
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2640
TRANSITIONS: 4040
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.062s, Sys 0.012s]
SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.014s, Sys 0.003s]
----------------------------------------------------------------------
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: 1204
MODEL NAME: /home/mcc/execution/407/model
2640 places, 4040 transitions.
Creating all event NSFs..
Creating all event NSFs..
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.
Building monolithic NSF...
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 LTLFireability -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="BART-PT-020"
export BK_EXAMINATION="LTLFireability"
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 BART-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166700468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-020.tgz
mv BART-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;