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.r468-smll-171620167700452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BART-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167700452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 179K Apr 12 21:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 625K Apr 12 21:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 241K Apr 12 21:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 803K Apr 12 21:26 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 262K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 158K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 426K Apr 12 22:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 22:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 545K Apr 12 21:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M Apr 12 21:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K 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 1.3M 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-005-LTLFireability-00
FORMULA_NAME BART-PT-005-LTLFireability-01
FORMULA_NAME BART-PT-005-LTLFireability-02
FORMULA_NAME BART-PT-005-LTLFireability-03
FORMULA_NAME BART-PT-005-LTLFireability-04
FORMULA_NAME BART-PT-005-LTLFireability-05
FORMULA_NAME BART-PT-005-LTLFireability-06
FORMULA_NAME BART-PT-005-LTLFireability-07
FORMULA_NAME BART-PT-005-LTLFireability-08
FORMULA_NAME BART-PT-005-LTLFireability-09
FORMULA_NAME BART-PT-005-LTLFireability-10
FORMULA_NAME BART-PT-005-LTLFireability-11
FORMULA_NAME BART-PT-005-LTLFireability-12
FORMULA_NAME BART-PT-005-LTLFireability-13
FORMULA_NAME BART-PT-005-LTLFireability-14
FORMULA_NAME BART-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717232669015

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:04:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:04:32] [INFO ] Load time of PNML (sax parser for PT used): 501 ms
[2024-06-01 09:04:32] [INFO ] Transformed 870 places.
[2024-06-01 09:04:32] [INFO ] Transformed 1010 transitions.
[2024-06-01 09:04:32] [INFO ] Found NUPN structural information;
[2024-06-01 09:04:32] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 767 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 660 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 42 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2024-06-01 09:04:33] [INFO ] Computed 5 invariants in 42 ms
[2024-06-01 09:04:34] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-06-01 09:04:34] [INFO ] Invariant cache hit.
[2024-06-01 09:04:35] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-01 09:04:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30068 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30033 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60598ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Finished structural reductions in LTL mode , in 1 iterations and 62604 ms. Remains : 660/660 places, 1010/1010 transitions.
Support contains 660 out of 660 places after structural reductions.
[2024-06-01 09:05:36] [INFO ] Flatten gal took : 224 ms
[2024-06-01 09:05:36] [INFO ] Flatten gal took : 120 ms
[2024-06-01 09:05:37] [INFO ] Input system was already deterministic with 1010 transitions.
Reduction of identical properties reduced properties to check from 26 to 24
RANDOM walk for 40000 steps (8 resets) in 1246 ms. (32 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
[2024-06-01 09:05:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 132/1670 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 72 ms.
Refiners :[Domain max(s): 2/660 constraints, Positive P Invariants (semi-flows): 1/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BART-PT-005-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(X((!p0 U (p1&&F(p2)))))'
Support contains 650 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 9 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2024-06-01 09:05:38] [INFO ] Invariant cache hit.
[2024-06-01 09:05:38] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 09:05:38] [INFO ] Invariant cache hit.
[2024-06-01 09:05:39] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-01 09:05:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 30309ms
Finished structural reductions in LTL mode , in 1 iterations and 31482 ms. Remains : 660/660 places, 1010/1010 transitions.
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BART-PT-005-LTLFireability-01
Product exploration explored 100000 steps with 49252 reset in 2575 ms.
Product exploration explored 100000 steps with 49296 reset in 2049 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) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 687 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 9 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 725 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2)]
[2024-06-01 09:06:17] [INFO ] Invariant cache hit.
[2024-06-01 09:06:25] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2024-06-01 09:06:27] [INFO ] [Real]Absence check using state equation in 2068 ms returned sat
[2024-06-01 09:06:27] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 715 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-005-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-005-LTLFireability-01 finished in 57540 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)||X(X(G(p1)))))'
Support contains 445 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 615 transition count 965
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 615 transition count 965
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 120 place count 585 transition count 935
Iterating global reduction 0 with 30 rules applied. Total rules applied 150 place count 585 transition count 935
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 165 place count 570 transition count 920
Iterating global reduction 0 with 15 rules applied. Total rules applied 180 place count 570 transition count 920
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 555 transition count 905
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 555 transition count 905
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 225 place count 540 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 240 place count 540 transition count 890
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 255 place count 525 transition count 875
Iterating global reduction 0 with 15 rules applied. Total rules applied 270 place count 525 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 515 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 300 place count 505 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 310 place count 505 transition count 855
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 315 place count 500 transition count 850
Iterating global reduction 0 with 5 rules applied. Total rules applied 320 place count 500 transition count 850
Applied a total of 320 rules in 147 ms. Remains 500 /660 variables (removed 160) and now considering 850/1010 (removed 160) transitions.
// Phase 1: matrix 850 rows 500 cols
[2024-06-01 09:06:36] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 09:06:36] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 09:06:36] [INFO ] Invariant cache hit.
[2024-06-01 09:06:36] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 09:06:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/1350 variables, and 5 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1350 variables, 670/1175 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 1175 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 500/660 places, 850/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61222 ms. Remains : 500/660 places, 850/1010 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-005-LTLFireability-02
Product exploration explored 100000 steps with 49266 reset in 1761 ms.
Product exploration explored 100000 steps with 49282 reset in 1639 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 143 steps (0 resets) in 11 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 319 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 445 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 850/850 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-06-01 09:07:42] [INFO ] Invariant cache hit.
[2024-06-01 09:07:42] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 09:07:42] [INFO ] Invariant cache hit.
[2024-06-01 09:07:42] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 09:07:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/1350 variables, and 5 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1350 variables, 670/1175 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 1175 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Finished structural reductions in LTL mode , in 1 iterations and 60988 ms. Remains : 500/500 places, 850/850 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 : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 117 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 441 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49288 reset in 1238 ms.
Product exploration explored 100000 steps with 49279 reset in 1189 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 445 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 850/850 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 500 transition count 850
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 10 place count 500 transition count 850
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 500 transition count 850
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 25 place count 490 transition count 840
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 35 place count 490 transition count 840
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 2 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 70 place count 490 transition count 840
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 490 transition count 835
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 105 place count 460 transition count 805
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 135 place count 460 transition count 805
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 135 rules in 127 ms. Remains 460 /500 variables (removed 40) and now considering 805/850 (removed 45) transitions.
[2024-06-01 09:08:47] [INFO ] Redundant transitions in 81 ms returned []
Running 625 sub problems to find dead transitions.
// Phase 1: matrix 805 rows 460 cols
[2024-06-01 09:08:47] [INFO ] Computed 5 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (OVERLAPS) 5/460 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-01 09:09:02] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 26 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 09:09:02] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 09:09:02] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 09:09:03] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 09:09:03] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 5/10 constraints. Problems are: Problem set: 10 solved, 615 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1265 variables, and 10 constraints, problems are : Problem set: 10 solved, 615 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/460 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 10 solved, 615 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 15/460 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 5/10 constraints. Problems are: Problem set: 10 solved, 615 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 615 unsolved
At refinement iteration 4 (OVERLAPS) 805/1265 variables, 460/470 constraints. Problems are: Problem set: 10 solved, 615 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1265 variables, 615/1085 constraints. Problems are: Problem set: 10 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1265/1265 variables, and 1085 constraints, problems are : Problem set: 10 solved, 615 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 615/625 constraints, Known Traps: 5/5 constraints]
After SMT, in 60162ms problems are : Problem set: 10 solved, 615 unsolved
Search for dead transitions found 10 dead transitions in 60175ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 460/500 places, 795/850 transitions.
Graph (complete) has 795 edges and 460 vertex of which 450 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.12 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 450 /460 variables (removed 10) and now considering 795/795 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 450/500 places, 795/850 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60450 ms. Remains : 450/500 places, 795/850 transitions.
Support contains 445 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 850/850 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 500 cols
[2024-06-01 09:09:48] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 09:09:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 09:09:48] [INFO ] Invariant cache hit.
[2024-06-01 09:09:48] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 09:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/1350 variables, and 5 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 5/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 850/1350 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1350 variables, 670/1175 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 1175 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 500/500 places, 850/850 transitions.
Treatment of property BART-PT-005-LTLFireability-02 finished in 253385 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(F(p0)))'
Support contains 340 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 645 transition count 995
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 645 transition count 995
Applied a total of 30 rules in 104 ms. Remains 645 /660 variables (removed 15) and now considering 995/1010 (removed 15) transitions.
// Phase 1: matrix 995 rows 645 cols
[2024-06-01 09:10:49] [INFO ] Computed 5 invariants in 10 ms
[2024-06-01 09:10:49] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 09:10:49] [INFO ] Invariant cache hit.
[2024-06-01 09:10:50] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2024-06-01 09:10:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 5/645 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/1640 variables, and 5 constraints, problems are : Problem set: 0 solved, 815 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/645 constraints, PredecessorRefiner: 815/815 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 5/645 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/1640 variables, and 5 constraints, problems are : Problem set: 0 solved, 815 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/645 constraints, PredecessorRefiner: 0/815 constraints, Known Traps: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 645/660 places, 995/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61047 ms. Remains : 645/660 places, 995/1010 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 1235 ms.
Product exploration explored 100000 steps with 50000 reset in 1102 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 (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-005-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-005-LTLFireability-03 finished in 63575 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 345 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 660 transition count 995
Reduce places removed 15 places and 0 transitions.
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Iterating post reduction 1 with 145 rules applied. Total rules applied 160 place count 645 transition count 865
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 295 place count 510 transition count 860
Iterating global reduction 3 with 5 rules applied. Total rules applied 300 place count 510 transition count 860
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 340 place count 490 transition count 840
Applied a total of 340 rules in 59 ms. Remains 490 /660 variables (removed 170) and now considering 840/1010 (removed 170) transitions.
// Phase 1: matrix 840 rows 490 cols
[2024-06-01 09:11:52] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 09:11:53] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 09:11:53] [INFO ] Invariant cache hit.
[2024-06-01 09:11:53] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-06-01 09:11:53] [INFO ] Redundant transitions in 21 ms returned []
Running 660 sub problems to find dead transitions.
[2024-06-01 09:11:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 5/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/1330 variables, and 5 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 5/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (OVERLAPS) 840/1330 variables, 490/495 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1330 variables, 660/1155 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 1155 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in SI_LTL mode, iteration 1 : 490/660 places, 840/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60908 ms. Remains : 490/660 places, 840/1010 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1122 ms.
Stack based approach found an accepted trace after 1840 steps with 0 reset with depth 1841 and stack size 1841 in 34 ms.
FORMULA BART-PT-005-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-04 finished in 62119 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(X(F((X(X(p1))||p0)))))'
Support contains 395 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 9 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
// Phase 1: matrix 1010 rows 660 cols
[2024-06-01 09:12:55] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 09:12:55] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-01 09:12:55] [INFO ] Invariant cache hit.
[2024-06-01 09:12:56] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-01 09:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 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 Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30028 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30034 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in LTL mode , in 1 iterations and 61164 ms. Remains : 660/660 places, 1010/1010 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-005-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 1185 ms.
Product exploration explored 100000 steps with 33333 reset in 872 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 p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-005-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-005-LTLFireability-05 finished in 63606 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 U p1))) U (G(p2)||F(G(p0)))))'
Support contains 490 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Applied a total of 0 rules in 4 ms. Remains 660 /660 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2024-06-01 09:13:58] [INFO ] Invariant cache hit.
[2024-06-01 09:13:58] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 09:13:58] [INFO ] Invariant cache hit.
[2024-06-01 09:13:59] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-01 09:13:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Error getting values : (error "ParserException while parsing response: ((s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/1670 variables, and 655 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30030 ms.
Refiners :[Domain max(s): 655/660 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 5/660 variables, 5/660 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/1670 variables, and 665 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30027 ms.
Refiners :[Domain max(s): 660/660 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/660 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in LTL mode , in 1 iterations and 61253 ms. Remains : 660/660 places, 1010/1010 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BART-PT-005-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 541 ms.
Stack based approach found an accepted trace after 5165 steps with 1 reset with depth 5162 and stack size 5162 in 34 ms.
FORMULA BART-PT-005-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLFireability-06 finished in 62138 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 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1006 edges and 660 vertex of which 633 / 660 are part of one of the 5 SCC in 8 ms
Free SCC test removed 628 places
Ensure Unique test removed 966 transitions
Reduce isomorphic transitions removed 966 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 28 transition count 23
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 10 transition count 18
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 5 rules applied. Total rules applied 50 place count 8 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 56 place count 6 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 59 place count 5 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 61 place count 4 transition count 8
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 62 place count 3 transition count 7
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 64 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 66 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 66 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 8 with 2 rules applied. Total rules applied 68 place count 2 transition count 3
Applied a total of 68 rules in 51 ms. Remains 2 /660 variables (removed 658) and now considering 3/1010 (removed 1007) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 09:15:00] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 09:15:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 09:15:00] [INFO ] Invariant cache hit.
[2024-06-01 09:15:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 09:15:00] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 09:15:00] [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 31 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 34 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 69ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/660 places, 3/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 2/660 places, 3/1010 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-08 finished in 371 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(p0)&&F(p1))||G(p1)||(p1&&F(p2))||X(G(p0))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 641 place count 332 transition count 682
Iterating global reduction 0 with 15 rules applied. Total rules applied 656 place count 332 transition count 682
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 671 place count 317 transition count 667
Iterating global reduction 0 with 15 rules applied. Total rules applied 686 place count 317 transition count 667
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 701 place count 302 transition count 652
Iterating global reduction 0 with 15 rules applied. Total rules applied 716 place count 302 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 731 place count 287 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 746 place count 287 transition count 637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 761 place count 272 transition count 622
Iterating global reduction 0 with 15 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 786 place count 262 transition count 612
Iterating global reduction 0 with 10 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 806 place count 252 transition count 602
Iterating global reduction 0 with 10 rules applied. Total rules applied 816 place count 252 transition count 602
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 821 place count 247 transition count 597
Iterating global reduction 0 with 5 rules applied. Total rules applied 826 place count 247 transition count 597
Applied a total of 826 rules in 154 ms. Remains 247 /660 variables (removed 413) and now considering 597/1010 (removed 413) transitions.
// Phase 1: matrix 597 rows 247 cols
[2024-06-01 09:15:01] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 09:15:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 09:15:01] [INFO ] Invariant cache hit.
[2024-06-01 09:15:01] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-06-01 09:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/844 variables, and 252 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 417/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 844/844 variables, and 669 constraints, problems are : Problem set: 0 solved, 417 unsolved in 23713 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
After SMT, in 53803ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 53808ms
Starting structural reductions in LTL mode, iteration 1 : 247/660 places, 597/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54367 ms. Remains : 247/660 places, 597/1010 transitions.
Stuttering acceptance computed with spot in 411 ms :[true, (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-005-LTLFireability-09
Product exploration explored 100000 steps with 24377 reset in 1171 ms.
Product exploration explored 100000 steps with 24349 reset in 769 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 p2 (NOT p1) p0), (X p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 693 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 16377 steps (3 resets) in 177 ms. (92 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 854 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 597/597 transitions.
Graph (trivial) has 557 edges and 247 vertex of which 196 / 247 are part of one of the 4 SCC in 1 ms
Free SCC test removed 192 places
Ensure Unique test removed 471 transitions
Reduce isomorphic transitions removed 471 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 52 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 51 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 50 transition count 122
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 27 place count 40 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 40 transition count 109
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 3 with 4 rules applied. Total rules applied 34 place count 38 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 38 place count 38 transition count 103
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 42 place count 36 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 46 place count 36 transition count 97
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 50 place count 34 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 54 place count 34 transition count 91
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 58 place count 32 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 62 place count 32 transition count 85
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 66 place count 30 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 70 place count 30 transition count 79
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 74 place count 28 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 78 place count 28 transition count 73
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 82 place count 26 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 86 place count 26 transition count 67
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 90 place count 24 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 94 place count 24 transition count 61
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 98 place count 22 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 102 place count 22 transition count 55
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 106 place count 20 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 110 place count 20 transition count 49
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 114 place count 18 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 118 place count 18 transition count 43
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 122 place count 16 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 126 place count 16 transition count 37
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 130 place count 14 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 134 place count 14 transition count 31
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 138 place count 12 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 142 place count 12 transition count 25
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 146 place count 10 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 150 place count 10 transition count 19
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 154 place count 8 transition count 17
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 158 place count 8 transition count 13
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 162 place count 6 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 164 place count 6 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 165 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 165 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 167 place count 5 transition count 6
Applied a total of 167 rules in 66 ms. Remains 5 /247 variables (removed 242) and now considering 6/597 (removed 591) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-06-01 09:16:00] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 09:16:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 09:16:00] [INFO ] Invariant cache hit.
[2024-06-01 09:16:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 09:16:00] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 09:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/247 places, 6/597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 5/247 places, 6/597 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 812 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 660 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-09 finished in 62025 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((p0 U G((X(X(p2))&&p1)))))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 453 place count 366 transition count 716
Iterating global reduction 0 with 135 rules applied. Total rules applied 588 place count 366 transition count 716
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 608 place count 346 transition count 696
Iterating global reduction 0 with 20 rules applied. Total rules applied 628 place count 346 transition count 696
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 643 place count 331 transition count 681
Iterating global reduction 0 with 15 rules applied. Total rules applied 658 place count 331 transition count 681
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 673 place count 316 transition count 666
Iterating global reduction 0 with 15 rules applied. Total rules applied 688 place count 316 transition count 666
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 703 place count 301 transition count 651
Iterating global reduction 0 with 15 rules applied. Total rules applied 718 place count 301 transition count 651
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 733 place count 286 transition count 636
Iterating global reduction 0 with 15 rules applied. Total rules applied 748 place count 286 transition count 636
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 763 place count 271 transition count 621
Iterating global reduction 0 with 15 rules applied. Total rules applied 778 place count 271 transition count 621
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 788 place count 261 transition count 611
Iterating global reduction 0 with 10 rules applied. Total rules applied 798 place count 261 transition count 611
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 808 place count 251 transition count 601
Iterating global reduction 0 with 10 rules applied. Total rules applied 818 place count 251 transition count 601
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 823 place count 246 transition count 596
Iterating global reduction 0 with 5 rules applied. Total rules applied 828 place count 246 transition count 596
Applied a total of 828 rules in 120 ms. Remains 246 /660 variables (removed 414) and now considering 596/1010 (removed 414) transitions.
// Phase 1: matrix 596 rows 246 cols
[2024-06-01 09:16:03] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 09:16:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 09:16:03] [INFO ] Invariant cache hit.
[2024-06-01 09:16:03] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-06-01 09:16:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 251 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 416/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (OVERLAPS) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 667 constraints, problems are : Problem set: 0 solved, 416 unsolved in 20111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 50219ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 50226ms
Starting structural reductions in LTL mode, iteration 1 : 246/660 places, 596/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50815 ms. Remains : 246/660 places, 596/1010 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-005-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-10 finished in 51395 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(X(((!p0 U p1)&&X((p2 U (G(p2)||(p2&&(F(!p1)||G(p3))))))))))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 89 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
// Phase 1: matrix 595 rows 245 cols
[2024-06-01 09:16:54] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 09:16:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 09:16:54] [INFO ] Invariant cache hit.
[2024-06-01 09:16:55] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-06-01 09:16:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 23383 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 53500ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 53507ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54057 ms. Remains : 245/660 places, 595/1010 transitions.
Stuttering acceptance computed with spot in 636 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3)), p1, (AND p1 (NOT p3))]
Running random walk in product with property : BART-PT-005-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-11 finished in 54730 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 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 500 transition count 850
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 500 transition count 850
Discarding 135 places :
Symmetric choice reduction at 0 with 135 rule applications. Total rules 455 place count 365 transition count 715
Iterating global reduction 0 with 135 rules applied. Total rules applied 590 place count 365 transition count 715
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 610 place count 345 transition count 695
Iterating global reduction 0 with 20 rules applied. Total rules applied 630 place count 345 transition count 695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 645 place count 330 transition count 680
Iterating global reduction 0 with 15 rules applied. Total rules applied 660 place count 330 transition count 680
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 675 place count 315 transition count 665
Iterating global reduction 0 with 15 rules applied. Total rules applied 690 place count 315 transition count 665
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 705 place count 300 transition count 650
Iterating global reduction 0 with 15 rules applied. Total rules applied 720 place count 300 transition count 650
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 735 place count 285 transition count 635
Iterating global reduction 0 with 15 rules applied. Total rules applied 750 place count 285 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 765 place count 270 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 780 place count 270 transition count 620
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 790 place count 260 transition count 610
Iterating global reduction 0 with 10 rules applied. Total rules applied 800 place count 260 transition count 610
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 810 place count 250 transition count 600
Iterating global reduction 0 with 10 rules applied. Total rules applied 820 place count 250 transition count 600
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 825 place count 245 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 830 place count 245 transition count 595
Applied a total of 830 rules in 84 ms. Remains 245 /660 variables (removed 415) and now considering 595/1010 (removed 415) transitions.
[2024-06-01 09:17:49] [INFO ] Invariant cache hit.
[2024-06-01 09:17:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 09:17:49] [INFO ] Invariant cache hit.
[2024-06-01 09:17:49] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-06-01 09:17:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 23363 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 53457ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 53463ms
Starting structural reductions in LTL mode, iteration 1 : 245/660 places, 595/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53978 ms. Remains : 245/660 places, 595/1010 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-12 finished in 54123 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))&&G((p1||F(p2)))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Graph (trivial) has 1002 edges and 660 vertex of which 522 / 660 are part of one of the 4 SCC in 2 ms
Free SCC test removed 518 places
Ensure Unique test removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 140 transition count 149
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 75 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 73 transition count 146
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 137 place count 73 transition count 142
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 69 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 151 place count 63 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 63 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 63 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 59 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 59 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 56 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 56 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 53 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 53 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 180 place count 51 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 51 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 49 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 49 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 48 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 48 transition count 120
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 4 with 14 rules applied. Total rules applied 202 place count 41 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 206 place count 41 transition count 109
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 210 place count 39 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 214 place count 39 transition count 103
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 218 place count 37 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 222 place count 37 transition count 97
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 226 place count 35 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 230 place count 35 transition count 91
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 234 place count 33 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 238 place count 33 transition count 85
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 242 place count 31 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 246 place count 31 transition count 79
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 250 place count 29 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 254 place count 29 transition count 73
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 258 place count 27 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 262 place count 27 transition count 67
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 266 place count 25 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 270 place count 25 transition count 61
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 274 place count 23 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 278 place count 23 transition count 55
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 282 place count 21 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 286 place count 21 transition count 49
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 290 place count 19 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 294 place count 19 transition count 43
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 298 place count 17 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 302 place count 17 transition count 37
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 306 place count 15 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 310 place count 15 transition count 31
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 314 place count 13 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 318 place count 13 transition count 25
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 322 place count 11 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 326 place count 11 transition count 19
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 20 with 4 rules applied. Total rules applied 330 place count 9 transition count 17
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 20 with 5 rules applied. Total rules applied 335 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 337 place count 8 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 337 place count 8 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 339 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 341 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 341 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 343 place count 6 transition count 7
Applied a total of 343 rules in 93 ms. Remains 6 /660 variables (removed 654) and now considering 7/1010 (removed 1003) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-06-01 09:18:43] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 09:18:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:18:43] [INFO ] Invariant cache hit.
[2024-06-01 09:18:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 09:18:43] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 09:18:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/660 places, 7/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 6/660 places, 7/1010 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (NOT p2)]
Running random walk in product with property : BART-PT-005-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-14 finished in 462 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||X((G(F(p1))&&F(p2))))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 605 place count 348 transition count 698
Iterating global reduction 0 with 19 rules applied. Total rules applied 624 place count 348 transition count 698
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 638 place count 334 transition count 684
Iterating global reduction 0 with 14 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 666 place count 320 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 680 place count 320 transition count 670
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 694 place count 306 transition count 656
Iterating global reduction 0 with 14 rules applied. Total rules applied 708 place count 306 transition count 656
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 722 place count 292 transition count 642
Iterating global reduction 0 with 14 rules applied. Total rules applied 736 place count 292 transition count 642
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 750 place count 278 transition count 628
Iterating global reduction 0 with 14 rules applied. Total rules applied 764 place count 278 transition count 628
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 774 place count 268 transition count 618
Iterating global reduction 0 with 10 rules applied. Total rules applied 784 place count 268 transition count 618
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 794 place count 258 transition count 608
Iterating global reduction 0 with 10 rules applied. Total rules applied 804 place count 258 transition count 608
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 809 place count 253 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 814 place count 253 transition count 603
Applied a total of 814 rules in 87 ms. Remains 253 /660 variables (removed 407) and now considering 603/1010 (removed 407) transitions.
// Phase 1: matrix 603 rows 253 cols
[2024-06-01 09:18:43] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 09:18:44] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 09:18:44] [INFO ] Invariant cache hit.
[2024-06-01 09:18:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-06-01 09:18:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 5/253 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 603/856 variables, 253/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 856/856 variables, and 258 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 5/253 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 603/856 variables, 253/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 423/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 0/856 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 681 constraints, problems are : Problem set: 0 solved, 423 unsolved in 24251 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints]
After SMT, in 54359ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 54366ms
Starting structural reductions in LTL mode, iteration 1 : 253/660 places, 603/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54912 ms. Remains : 253/660 places, 603/1010 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-005-LTLFireability-15
Product exploration explored 100000 steps with 321 reset in 217 ms.
Product exploration explored 100000 steps with 354 reset in 285 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 p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 36734 steps (8 resets) in 188 ms. (194 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 701 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 603/603 transitions.
Graph (trivial) has 597 edges and 253 vertex of which 244 / 253 are part of one of the 5 SCC in 1 ms
Free SCC test removed 239 places
Ensure Unique test removed 583 transitions
Reduce isomorphic transitions removed 583 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 11 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 18 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 19 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 21 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 21 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 23 place count 4 transition count 5
Applied a total of 23 rules in 10 ms. Remains 4 /253 variables (removed 249) and now considering 5/603 (removed 598) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-06-01 09:19:41] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 09:19:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:19:41] [INFO ] Invariant cache hit.
[2024-06-01 09:19:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 09:19:41] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 09:19:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/253 places, 5/603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 4/253 places, 5/603 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 680 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 845 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLFireability-15 finished in 60443 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)||X(X(G(p1)))))'
Found a Lengthening insensitive property : BART-PT-005-LTLFireability-02
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 445 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 660 transition count 1000
Reduce places removed 10 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 1 with 55 rules applied. Total rules applied 65 place count 650 transition count 955
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 110 place count 605 transition count 955
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 110 place count 605 transition count 930
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 160 place count 580 transition count 930
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 190 place count 550 transition count 900
Iterating global reduction 3 with 30 rules applied. Total rules applied 220 place count 550 transition count 900
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 225 place count 550 transition count 895
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 240 place count 535 transition count 880
Iterating global reduction 4 with 15 rules applied. Total rules applied 255 place count 535 transition count 880
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 270 place count 520 transition count 865
Iterating global reduction 4 with 15 rules applied. Total rules applied 285 place count 520 transition count 865
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 300 place count 505 transition count 850
Iterating global reduction 4 with 15 rules applied. Total rules applied 315 place count 505 transition count 850
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 495 transition count 840
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 495 transition count 840
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 345 place count 485 transition count 830
Iterating global reduction 4 with 10 rules applied. Total rules applied 355 place count 485 transition count 830
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 360 place count 480 transition count 825
Iterating global reduction 4 with 5 rules applied. Total rules applied 365 place count 480 transition count 825
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 425 place count 450 transition count 795
Applied a total of 425 rules in 74 ms. Remains 450 /660 variables (removed 210) and now considering 795/1010 (removed 215) transitions.
// Phase 1: matrix 795 rows 450 cols
[2024-06-01 09:19:44] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 09:19:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 09:19:45] [INFO ] Invariant cache hit.
[2024-06-01 09:19:45] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 615 sub problems to find dead transitions.
[2024-06-01 09:19:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 455 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 615 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 615/1070 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1070 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 615 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LI_LTL mode, iteration 1 : 450/660 places, 795/1010 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60957 ms. Remains : 450/660 places, 795/1010 transitions.
Running random walk in product with property : BART-PT-005-LTLFireability-02
Product exploration explored 100000 steps with 49288 reset in 1792 ms.
Product exploration explored 100000 steps with 49290 reset in 1600 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1786 steps (0 resets) in 15 ms. (111 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 406 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 445 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 795/795 transitions.
Applied a total of 0 rules in 3 ms. Remains 450 /450 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2024-06-01 09:20:50] [INFO ] Invariant cache hit.
[2024-06-01 09:20:50] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 09:20:50] [INFO ] Invariant cache hit.
[2024-06-01 09:20:51] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Running 615 sub problems to find dead transitions.
[2024-06-01 09:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 455 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 615 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 615/1070 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1070 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 615 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in LTL mode , in 1 iterations and 60947 ms. Remains : 450/450 places, 795/795 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 : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 307 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2225 steps (0 resets) in 28 ms. (76 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 432 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49278 reset in 1187 ms.
Product exploration explored 100000 steps with 49272 reset in 1055 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 445 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 795/795 transitions.
Applied a total of 0 rules in 15 ms. Remains 450 /450 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2024-06-01 09:21:55] [INFO ] Redundant transitions in 68 ms returned []
Running 615 sub problems to find dead transitions.
[2024-06-01 09:21:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 455 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 615 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 615/1070 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1070 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 615 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60294 ms. Remains : 450/450 places, 795/795 transitions.
Support contains 445 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 795/795 transitions.
Applied a total of 0 rules in 2 ms. Remains 450 /450 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2024-06-01 09:22:56] [INFO ] Invariant cache hit.
[2024-06-01 09:22:56] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 09:22:56] [INFO ] Invariant cache hit.
[2024-06-01 09:22:56] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 615 sub problems to find dead transitions.
[2024-06-01 09:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 455 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 615 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 5/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 795/1245 variables, 450/455 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 615/1070 constraints. Problems are: Problem set: 0 solved, 615 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1070 constraints, problems are : Problem set: 0 solved, 615 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 615/615 constraints, Known Traps: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 615 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 450/450 places, 795/795 transitions.
Treatment of property BART-PT-005-LTLFireability-02 finished in 252825 ms.
[2024-06-01 09:23:57] [INFO ] Flatten gal took : 74 ms
[2024-06-01 09:23:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 21 ms.
[2024-06-01 09:23:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 660 places, 1010 transitions and 2020 arcs took 17 ms.
Total runtime 1165451 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BART-PT-005-LTLFireability-02

BK_STOP 1717235103395

--------------------
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
mcc2024
ltl formula name BART-PT-005-LTLFireability-02
ltl formula formula --ltl=/tmp/2458/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 660 places, 1010 transitions and 2020 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.060 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2458/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2458/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2458/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2458/ltl_0_

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-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BART-PT-005, 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 r468-smll-171620167700452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;