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.r026-smll-171620167100172.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 itstools
Input is AutoFlight-PT-24a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 169K 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 AutoFlight-PT-24a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716285278763

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 09:54:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 09:54:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:54:41] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2024-05-21 09:54:41] [INFO ] Transformed 607 places.
[2024-05-21 09:54:41] [INFO ] Transformed 605 transitions.
[2024-05-21 09:54:41] [INFO ] Found NUPN structural information;
[2024-05-21 09:54:41] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
FORMULA AutoFlight-PT-24a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 607/607 places, 485/485 transitions.
Applied a total of 0 rules in 166 ms. Remains 607 /607 variables (removed 0) and now considering 485/485 (removed 0) transitions.
// Phase 1: matrix 485 rows 607 cols
[2024-05-21 09:54:42] [INFO ] Computed 148 invariants in 49 ms
[2024-05-21 09:54:44] [INFO ] Implicit Places using invariants in 1719 ms returned [7, 14, 28, 35, 49, 56, 63, 70, 77, 84, 91, 98, 112, 119, 133, 140, 147, 154, 161, 168, 171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 216, 219, 222, 225, 228, 231, 234, 240, 362, 460, 466, 472, 484, 490, 496, 502, 508, 514, 520, 526, 532, 538, 544, 550, 556, 562, 568, 574, 580, 586, 592, 598, 604]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 1789 ms to find 67 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/607 places, 485/485 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 517 transition count 462
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 517 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 516 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 516 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 515 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 515 transition count 460
Applied a total of 50 rules in 130 ms. Remains 515 /540 variables (removed 25) and now considering 460/485 (removed 25) transitions.
// Phase 1: matrix 460 rows 515 cols
[2024-05-21 09:54:44] [INFO ] Computed 81 invariants in 12 ms
[2024-05-21 09:54:44] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 09:54:44] [INFO ] Invariant cache hit.
[2024-05-21 09:54:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 09:54:45] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 515/607 places, 460/485 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3395 ms. Remains : 515/607 places, 460/485 transitions.
Support contains 42 out of 515 places after structural reductions.
[2024-05-21 09:54:46] [INFO ] Flatten gal took : 143 ms
[2024-05-21 09:54:46] [INFO ] Flatten gal took : 67 ms
[2024-05-21 09:54:46] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 36 out of 515 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (452 resets) in 2806 ms. (14 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40004 steps (12 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
[2024-05-21 09:54:47] [INFO ] Invariant cache hit.
[2024-05-21 09:54:47] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 318/322 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 193/515 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 460/975 variables, 515/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/975 variables, 18/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/975 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/975 variables, and 614 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 515/515 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 318/322 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 193/515 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 460/975 variables, 515/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/975 variables, 18/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/975 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 975/975 variables, and 618 constraints, problems are : Problem set: 0 solved, 4 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 515/515 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2048ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 229 steps, including 3 resets, run visited all 4 properties in 6 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 14 ms.
Computed a total of 7 stabilizing places and 1 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(X(F((F(p0)&&(p1||X(p2)))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 514 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 513 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Applied a total of 96 rules in 837 ms. Remains 467 /515 variables (removed 48) and now considering 412/460 (removed 48) transitions.
// Phase 1: matrix 412 rows 467 cols
[2024-05-21 09:54:50] [INFO ] Computed 81 invariants in 8 ms
[2024-05-21 09:54:51] [INFO ] Implicit Places using invariants in 551 ms returned [19, 38, 93, 112, 179, 196, 379]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 553 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/515 places, 412/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 410
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 457 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 437 transition count 389
Applied a total of 46 rules in 324 ms. Remains 437 /460 variables (removed 23) and now considering 389/412 (removed 23) transitions.
// Phase 1: matrix 389 rows 437 cols
[2024-05-21 09:54:51] [INFO ] Computed 74 invariants in 5 ms
[2024-05-21 09:54:52] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-21 09:54:52] [INFO ] Invariant cache hit.
[2024-05-21 09:54:52] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/515 places, 389/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2747 ms. Remains : 437/515 places, 389/460 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-00
Stuttering criterion allowed to conclude after 101 steps with 6 reset in 20 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-00 finished in 3374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 508 transition count 299
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 327 place count 348 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 347 transition count 298
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 328 place count 347 transition count 251
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 445 place count 277 transition count 251
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 445 place count 277 transition count 228
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 491 place count 254 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 492 place count 253 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 253 transition count 227
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 593 place count 203 transition count 177
Applied a total of 593 rules in 159 ms. Remains 203 /515 variables (removed 312) and now considering 177/460 (removed 283) transitions.
// Phase 1: matrix 177 rows 203 cols
[2024-05-21 09:54:53] [INFO ] Computed 52 invariants in 2 ms
[2024-05-21 09:54:53] [INFO ] Implicit Places using invariants in 292 ms returned [156, 202]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/515 places, 177/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 200 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 200 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 199 transition count 175
Applied a total of 4 rules in 38 ms. Remains 199 /201 variables (removed 2) and now considering 175/177 (removed 2) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-21 09:54:53] [INFO ] Computed 50 invariants in 3 ms
[2024-05-21 09:54:54] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 09:54:54] [INFO ] Invariant cache hit.
[2024-05-21 09:54:54] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1148 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-02
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-02 finished in 1319 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' '!((p0 U X(p1)))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 651 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-21 09:54:55] [INFO ] Computed 81 invariants in 5 ms
[2024-05-21 09:54:55] [INFO ] Implicit Places using invariants in 485 ms returned [19, 38, 93, 112, 179, 196, 465]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 488 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/515 places, 411/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 458 transition count 410
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 457 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 389
Applied a total of 44 rules in 214 ms. Remains 437 /459 variables (removed 22) and now considering 389/411 (removed 22) transitions.
// Phase 1: matrix 389 rows 437 cols
[2024-05-21 09:54:55] [INFO ] Computed 74 invariants in 3 ms
[2024-05-21 09:54:56] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 09:54:56] [INFO ] Invariant cache hit.
[2024-05-21 09:54:56] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/515 places, 389/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2281 ms. Remains : 437/515 places, 389/460 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-03 finished in 2476 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 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 395 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-21 09:54:57] [INFO ] Computed 81 invariants in 5 ms
[2024-05-21 09:54:57] [INFO ] Implicit Places using invariants in 524 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 526 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 253 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-21 09:54:58] [INFO ] Computed 73 invariants in 5 ms
[2024-05-21 09:54:58] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 09:54:58] [INFO ] Invariant cache hit.
[2024-05-21 09:54:59] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2226 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1561 steps with 17 reset in 28 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-04 finished in 2372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 515 transition count 328
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 383 transition count 328
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 264 place count 383 transition count 266
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 388 place count 321 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 319 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 498 place count 266 transition count 211
Applied a total of 498 rules in 93 ms. Remains 266 /515 variables (removed 249) and now considering 211/460 (removed 249) transitions.
// Phase 1: matrix 211 rows 266 cols
[2024-05-21 09:54:59] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 09:54:59] [INFO ] Implicit Places using invariants in 367 ms returned [13, 63, 76, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 198, 265]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 384 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/515 places, 211/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 235 transition count 181
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 205 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 60 place count 205 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 72 place count 199 transition count 175
Applied a total of 72 rules in 38 ms. Remains 199 /235 variables (removed 36) and now considering 175/211 (removed 36) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-21 09:54:59] [INFO ] Computed 50 invariants in 8 ms
[2024-05-21 09:55:00] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 09:55:00] [INFO ] Invariant cache hit.
[2024-05-21 09:55:00] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 09:55:00] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1401 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-05
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-05 finished in 1507 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 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 508 transition count 296
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 332 place count 345 transition count 296
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 332 place count 345 transition count 249
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 449 place count 275 transition count 249
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 449 place count 275 transition count 226
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 495 place count 252 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 497 place count 250 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 499 place count 250 transition count 224
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 597 place count 201 transition count 175
Applied a total of 597 rules in 38 ms. Remains 201 /515 variables (removed 314) and now considering 175/460 (removed 285) transitions.
// Phase 1: matrix 175 rows 201 cols
[2024-05-21 09:55:00] [INFO ] Computed 52 invariants in 1 ms
[2024-05-21 09:55:01] [INFO ] Implicit Places using invariants in 275 ms returned [154, 200]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 277 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/515 places, 175/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 198 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 173
Applied a total of 4 rules in 15 ms. Remains 197 /199 variables (removed 2) and now considering 173/175 (removed 2) transitions.
// Phase 1: matrix 173 rows 197 cols
[2024-05-21 09:55:01] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 09:55:01] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 09:55:01] [INFO ] Invariant cache hit.
[2024-05-21 09:55:01] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/515 places, 173/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 876 ms. Remains : 197/515 places, 173/460 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-06
Product exploration explored 100000 steps with 1766 reset in 615 ms.
Product exploration explored 100000 steps with 1792 reset in 647 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 3829 steps (71 resets) in 26 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-21 09:55:03] [INFO ] Invariant cache hit.
[2024-05-21 09:55:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 09:55:03] [INFO ] Invariant cache hit.
[2024-05-21 09:55:03] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-21 09:55:03] [INFO ] Redundant transitions in 10 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 09:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 247 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4801 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 345 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5794 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 10647ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10653ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11111 ms. Remains : 197/197 places, 173/173 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 5456 steps (96 resets) in 32 ms. (165 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1767 reset in 517 ms.
Product exploration explored 100000 steps with 1785 reset in 427 ms.
Built C files in :
/tmp/ltsmin17287661566125813948
[2024-05-21 09:55:16] [INFO ] Computing symmetric may disable matrix : 173 transitions.
[2024-05-21 09:55:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:16] [INFO ] Computing symmetric may enable matrix : 173 transitions.
[2024-05-21 09:55:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:16] [INFO ] Computing Do-Not-Accords matrix : 173 transitions.
[2024-05-21 09:55:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:16] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17287661566125813948
Running compilation step : cd /tmp/ltsmin17287661566125813948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1240 ms.
Running link step : cd /tmp/ltsmin17287661566125813948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin17287661566125813948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8360785463564837214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-21 09:55:31] [INFO ] Invariant cache hit.
[2024-05-21 09:55:31] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 09:55:31] [INFO ] Invariant cache hit.
[2024-05-21 09:55:31] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-21 09:55:31] [INFO ] Redundant transitions in 6 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 09:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 247 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5562 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/197 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 173/370 variables, 197/247 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 98/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 345 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5578 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 11165ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 11169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11772 ms. Remains : 197/197 places, 173/173 transitions.
Built C files in :
/tmp/ltsmin6108335417680809436
[2024-05-21 09:55:42] [INFO ] Computing symmetric may disable matrix : 173 transitions.
[2024-05-21 09:55:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:42] [INFO ] Computing symmetric may enable matrix : 173 transitions.
[2024-05-21 09:55:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:42] [INFO ] Computing Do-Not-Accords matrix : 173 transitions.
[2024-05-21 09:55:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:55:42] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6108335417680809436
Running compilation step : cd /tmp/ltsmin6108335417680809436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 918 ms.
Running link step : cd /tmp/ltsmin6108335417680809436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6108335417680809436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13575156604613402392.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:55:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 09:55:58] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:55:58] [INFO ] Time to serialize gal into /tmp/LTL18416815924295092351.gal : 5 ms
[2024-05-21 09:55:58] [INFO ] Time to serialize properties into /tmp/LTL7410554608137720616.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18416815924295092351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1662946628661374753.hoa' '-atoms' '/tmp/LTL7410554608137720616.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7410554608137720616.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1662946628661374753.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 48 deadlock states
Detected timeout of ITS tools.
[2024-05-21 09:56:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:56:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:56:13] [INFO ] Time to serialize gal into /tmp/LTL11642576923633518974.gal : 6 ms
[2024-05-21 09:56:13] [INFO ] Time to serialize properties into /tmp/LTL14014248144505303008.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11642576923633518974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14014248144505303008.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p199==0)||(p524==0))"))))
Formula 0 simplified : GF!"((p199==0)||(p524==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 48 deadlock states
Detected timeout of ITS tools.
[2024-05-21 09:56:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:56:28] [INFO ] Applying decomposition
[2024-05-21 09:56:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12021458167945123694.txt' '-o' '/tmp/graph12021458167945123694.bin' '-w' '/tmp/graph12021458167945123694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12021458167945123694.bin' '-l' '-1' '-v' '-w' '/tmp/graph12021458167945123694.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:56:28] [INFO ] Decomposing Gal with order
[2024-05-21 09:56:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:56:28] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-21 09:56:28] [INFO ] Flatten gal took : 79 ms
[2024-05-21 09:56:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 09:56:28] [INFO ] Time to serialize gal into /tmp/LTL4274816403751158546.gal : 8 ms
[2024-05-21 09:56:28] [INFO ] Time to serialize properties into /tmp/LTL16242035657786481497.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4274816403751158546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16242035657786481497.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.i1.u48.p199==0)||(i1.i1.u67.p524==0))"))))
Formula 0 simplified : GF!"((i1.i1.u48.p199==0)||(i1.i1.u67.p524==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 48 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24a-LTLFireability-06 finished in 102682 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(G(p0))||G(p1))))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 596 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-21 09:56:44] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 09:56:44] [INFO ] Implicit Places using invariants in 412 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 414 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 223 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-21 09:56:44] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 09:56:45] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-21 09:56:45] [INFO ] Invariant cache hit.
[2024-05-21 09:56:45] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2260 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-07
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-07 finished in 2408 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 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 266 place count 382 transition count 267
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 386 place count 322 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 320 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 319 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 500 place count 265 transition count 210
Applied a total of 500 rules in 94 ms. Remains 265 /515 variables (removed 250) and now considering 210/460 (removed 250) transitions.
// Phase 1: matrix 210 rows 265 cols
[2024-05-21 09:56:46] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 09:56:46] [INFO ] Implicit Places using invariants in 499 ms returned [13, 26, 63, 76, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 123, 124, 125, 126, 127, 128, 196, 264]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 500 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/515 places, 210/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 234 transition count 178
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 175
Applied a total of 70 rules in 20 ms. Remains 199 /234 variables (removed 35) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-21 09:56:46] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 09:56:46] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 09:56:46] [INFO ] Invariant cache hit.
[2024-05-21 09:56:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 09:56:47] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1305 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-08
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-08 finished in 1365 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(X((G(F(!p0))||(F(!p0)&&F(G(!p1))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 362 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-21 09:56:47] [INFO ] Computed 81 invariants in 4 ms
[2024-05-21 09:56:48] [INFO ] Implicit Places using invariants in 449 ms returned [19, 38, 93, 112, 179, 379, 465]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 452 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 457 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 436 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 436 transition count 388
Applied a total of 46 rules in 151 ms. Remains 436 /459 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 436 cols
[2024-05-21 09:56:48] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 09:56:48] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 09:56:48] [INFO ] Invariant cache hit.
[2024-05-21 09:56:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 09:56:49] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 436/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2114 ms. Remains : 436/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 386 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-09
Product exploration explored 100000 steps with 1125 reset in 794 ms.
Product exploration explored 100000 steps with 1131 reset in 546 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 10778 steps (118 resets) in 76 ms. (139 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 299 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Applied a total of 0 rules in 10 ms. Remains 436 /436 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-05-21 09:56:52] [INFO ] Invariant cache hit.
[2024-05-21 09:56:52] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 09:56:52] [INFO ] Invariant cache hit.
[2024-05-21 09:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 09:56:53] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2024-05-21 09:56:53] [INFO ] Invariant cache hit.
[2024-05-21 09:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 387 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 824/824 variables, and 511 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 387/898 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-05-21 09:57:43] [INFO ] Deduced a trap composed of 215 places in 304 ms of which 50 ms to minimize.
[2024-05-21 09:57:43] [INFO ] Deduced a trap composed of 198 places in 208 ms of which 4 ms to minimize.
[2024-05-21 09:57:44] [INFO ] Deduced a trap composed of 224 places in 149 ms of which 4 ms to minimize.
[2024-05-21 09:57:44] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 6 ms to minimize.
[2024-05-21 09:57:45] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 3 ms to minimize.
[2024-05-21 09:57:50] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 5 ms to minimize.
[2024-05-21 09:57:50] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 3 ms to minimize.
[2024-05-21 09:57:50] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 3 ms to minimize.
[2024-05-21 09:57:50] [INFO ] Deduced a trap composed of 128 places in 95 ms of which 3 ms to minimize.
[2024-05-21 09:57:51] [INFO ] Deduced a trap composed of 119 places in 86 ms of which 2 ms to minimize.
[2024-05-21 09:57:51] [INFO ] Deduced a trap composed of 133 places in 89 ms of which 2 ms to minimize.
[2024-05-21 09:57:51] [INFO ] Deduced a trap composed of 121 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 910 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 12/12 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in LTL mode , in 1 iterations and 61085 ms. Remains : 436/436 places, 388/388 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 15473 steps (168 resets) in 110 ms. (139 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 370 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 354 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1146 reset in 683 ms.
Product exploration explored 100000 steps with 1149 reset in 551 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 436 transition count 388
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 117 place count 436 transition count 388
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 141 place count 436 transition count 388
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 233 place count 344 transition count 296
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 325 place count 344 transition count 296
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 374 place count 344 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 378 place count 340 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 382 place count 340 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Applied a total of 382 rules in 89 ms. Remains 340 /436 variables (removed 96) and now considering 292/388 (removed 96) transitions.
[2024-05-21 09:57:57] [INFO ] Redundant transitions in 16 ms returned []
Running 291 sub problems to find dead transitions.
// Phase 1: matrix 292 rows 340 cols
[2024-05-21 09:57:57] [INFO ] Computed 74 invariants in 2 ms
[2024-05-21 09:57:57] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 09:58:01] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-21 09:58:02] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 09:58:03] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 20/94 constraints. Problems are: Problem set: 20 solved, 271 unsolved
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 11 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 4 ms to minimize.
[2024-05-21 09:58:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 4 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 4 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 4 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 4 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/114 constraints. Problems are: Problem set: 39 solved, 252 unsolved
[2024-05-21 09:58:09] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 4 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 09:58:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 09:58:09] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 4 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 123 places in 173 ms of which 4 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-21 09:58:10] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 20/134 constraints. Problems are: Problem set: 82 solved, 209 unsolved
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
[2024-05-21 09:58:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-21 09:58:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-21 09:58:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
[2024-05-21 09:58:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-21 09:58:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 12/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 292/632 variables, 340/486 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 71/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 557 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 340/340 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 94 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 95/340 variables, 74/74 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 72/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/146 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 292/632 variables, 340/486 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 71/557 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 197/754 constraints. Problems are: Problem set: 94 solved, 197 unsolved
[2024-05-21 09:58:48] [INFO ] Deduced a trap composed of 120 places in 182 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 1/755 constraints. Problems are: Problem set: 94 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 755 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 340/340 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 197/291 constraints, Known Traps: 73/73 constraints]
After SMT, in 60141ms problems are : Problem set: 94 solved, 197 unsolved
Search for dead transitions found 94 dead transitions in 60146ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 340/436 places, 198/388 transitions.
Graph (complete) has 634 edges and 340 vertex of which 246 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.3 ms
Discarding 94 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 246 /340 variables (removed 94) and now considering 198/198 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/436 places, 198/388 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60285 ms. Remains : 246/436 places, 198/388 transitions.
Built C files in :
/tmp/ltsmin5786595750434094637
[2024-05-21 09:58:57] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5786595750434094637
Running compilation step : cd /tmp/ltsmin5786595750434094637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1405 ms.
Running link step : cd /tmp/ltsmin5786595750434094637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5786595750434094637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1011052159489162365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 388/388 transitions.
Applied a total of 0 rules in 6 ms. Remains 436 /436 variables (removed 0) and now considering 388/388 (removed 0) transitions.
// Phase 1: matrix 388 rows 436 cols
[2024-05-21 09:59:12] [INFO ] Computed 74 invariants in 3 ms
[2024-05-21 09:59:12] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-21 09:59:12] [INFO ] Invariant cache hit.
[2024-05-21 09:59:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 09:59:13] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2024-05-21 09:59:13] [INFO ] Invariant cache hit.
[2024-05-21 09:59:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 824/824 variables, and 511 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/824 variables, 436/510 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/824 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 387/898 constraints. Problems are: Problem set: 0 solved, 387 unsolved
[2024-05-21 10:00:03] [INFO ] Deduced a trap composed of 215 places in 294 ms of which 6 ms to minimize.
[2024-05-21 10:00:04] [INFO ] Deduced a trap composed of 198 places in 278 ms of which 5 ms to minimize.
[2024-05-21 10:00:05] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 5 ms to minimize.
[2024-05-21 10:00:05] [INFO ] Deduced a trap composed of 233 places in 281 ms of which 5 ms to minimize.
[2024-05-21 10:00:06] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 2 ms to minimize.
[2024-05-21 10:00:11] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 2 ms to minimize.
[2024-05-21 10:00:11] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 3 ms to minimize.
[2024-05-21 10:00:11] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-21 10:00:11] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 2 ms to minimize.
[2024-05-21 10:00:12] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 2 ms to minimize.
[2024-05-21 10:00:12] [INFO ] Deduced a trap composed of 133 places in 102 ms of which 2 ms to minimize.
[2024-05-21 10:00:12] [INFO ] Deduced a trap composed of 121 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 910 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, State Equation: 436/436 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 12/12 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in LTL mode , in 1 iterations and 61013 ms. Remains : 436/436 places, 388/388 transitions.
Built C files in :
/tmp/ltsmin2308620011752418991
[2024-05-21 10:00:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2308620011752418991
Running compilation step : cd /tmp/ltsmin2308620011752418991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1453 ms.
Running link step : cd /tmp/ltsmin2308620011752418991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2308620011752418991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8317921922141709099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:00:28] [INFO ] Flatten gal took : 33 ms
[2024-05-21 10:00:28] [INFO ] Flatten gal took : 22 ms
[2024-05-21 10:00:28] [INFO ] Time to serialize gal into /tmp/LTL3028208413148437509.gal : 11 ms
[2024-05-21 10:00:28] [INFO ] Time to serialize properties into /tmp/LTL14456780260534204876.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3028208413148437509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1211008997670812657.hoa' '-atoms' '/tmp/LTL14456780260534204876.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14456780260534204876.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1211008997670812657.hoa
Detected timeout of ITS tools.
[2024-05-21 10:00:43] [INFO ] Flatten gal took : 20 ms
[2024-05-21 10:00:43] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:00:43] [INFO ] Time to serialize gal into /tmp/LTL15728610433351013535.gal : 4 ms
[2024-05-21 10:00:43] [INFO ] Time to serialize properties into /tmp/LTL15084785611414181146.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15728610433351013535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15084785611414181146.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((p237!=1)||(p597!=1))")))||((F("((p237!=1)||(p597!=1))"))&&(F(G("((p80!=1)&&(p40!=1))")))))))))
Formula 0 simplified : XXX(FG!"((p237!=1)||(p597!=1))" & (G!"((p237!=1)||(p597!=1))" | GF!"((p80!=1)&&(p40!=1))"))
Detected timeout of ITS tools.
[2024-05-21 10:00:58] [INFO ] Flatten gal took : 20 ms
[2024-05-21 10:00:58] [INFO ] Applying decomposition
[2024-05-21 10:00:58] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2124428182315325447.txt' '-o' '/tmp/graph2124428182315325447.bin' '-w' '/tmp/graph2124428182315325447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2124428182315325447.bin' '-l' '-1' '-v' '-w' '/tmp/graph2124428182315325447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:00:58] [INFO ] Decomposing Gal with order
[2024-05-21 10:00:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:00:59] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-21 10:00:59] [INFO ] Flatten gal took : 49 ms
[2024-05-21 10:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 10:00:59] [INFO ] Time to serialize gal into /tmp/LTL11728409384565574400.gal : 12 ms
[2024-05-21 10:00:59] [INFO ] Time to serialize properties into /tmp/LTL15805353689172490761.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11728409384565574400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15805353689172490761.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((i20.i2.u181.p237!=1)||(i23.u184.p597!=1))")))||((F("((i20.i2.u181.p237!=1)||(i23.u184.p597!=1))"))&&(F(G("((i4.i1.u22...194
Formula 0 simplified : XXX(FG!"((i20.i2.u181.p237!=1)||(i23.u184.p597!=1))" & (G!"((i20.i2.u181.p237!=1)||(i23.u184.p597!=1))" | GF!"((i4.i1.u22.p80!=1)&&(...176
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24a-LTLFireability-09 finished in 266762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 515 transition count 328
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 383 transition count 328
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 264 place count 383 transition count 266
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 388 place count 321 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 319 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 500 place count 265 transition count 210
Applied a total of 500 rules in 47 ms. Remains 265 /515 variables (removed 250) and now considering 210/460 (removed 250) transitions.
// Phase 1: matrix 210 rows 265 cols
[2024-05-21 10:01:14] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 10:01:14] [INFO ] Implicit Places using invariants in 478 ms returned [13, 26, 76, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 197, 264]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 480 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/515 places, 210/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 234 transition count 181
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 205 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 58 place count 205 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 202 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 201 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 201 transition count 177
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 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 175
Applied a total of 70 rules in 14 ms. Remains 199 /234 variables (removed 35) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 199 cols
[2024-05-21 10:01:14] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 10:01:14] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 10:01:14] [INFO ] Invariant cache hit.
[2024-05-21 10:01:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 10:01:15] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/515 places, 175/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1073 ms. Remains : 199/515 places, 175/460 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-10
Product exploration explored 100000 steps with 1770 reset in 304 ms.
Product exploration explored 100000 steps with 1790 reset in 342 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4978 steps (83 resets) in 25 ms. (191 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 10:01:16] [INFO ] Invariant cache hit.
[2024-05-21 10:01:16] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 10:01:16] [INFO ] Invariant cache hit.
[2024-05-21 10:01:16] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 10:01:17] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-05-21 10:01:17] [INFO ] Redundant transitions in 2 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 10:01:17] [INFO ] Invariant cache hit.
[2024-05-21 10:01:17] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 300 constraints, problems are : Problem set: 0 solved, 174 unsolved in 11266 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 174/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 22730 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 34050ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 34053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34783 ms. Remains : 199/199 places, 175/175 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10549 steps (185 resets) in 39 ms. (263 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1759 reset in 510 ms.
Product exploration explored 100000 steps with 1766 reset in 514 ms.
Built C files in :
/tmp/ltsmin2070191378856242183
[2024-05-21 10:01:52] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-05-21 10:01:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:01:52] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-05-21 10:01:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:01:52] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2024-05-21 10:01:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:01:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2070191378856242183
Running compilation step : cd /tmp/ltsmin2070191378856242183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 679 ms.
Running link step : cd /tmp/ltsmin2070191378856242183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2070191378856242183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8602393677035917369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 10:02:07] [INFO ] Invariant cache hit.
[2024-05-21 10:02:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 10:02:08] [INFO ] Invariant cache hit.
[2024-05-21 10:02:08] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 10:02:08] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-21 10:02:08] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 10:02:08] [INFO ] Invariant cache hit.
[2024-05-21 10:02:08] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 300 constraints, problems are : Problem set: 0 solved, 174 unsolved in 11770 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 175/374 variables, 199/249 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 51/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 174/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 474 constraints, problems are : Problem set: 0 solved, 174 unsolved in 22127 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 199/199 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 33944ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 33946ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34541 ms. Remains : 199/199 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin8544695740518458626
[2024-05-21 10:02:42] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-05-21 10:02:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:02:42] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-05-21 10:02:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:02:42] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2024-05-21 10:02:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:02:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8544695740518458626
Running compilation step : cd /tmp/ltsmin8544695740518458626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 818 ms.
Running link step : cd /tmp/ltsmin8544695740518458626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8544695740518458626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16083029705299723048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:02:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:02:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:02:57] [INFO ] Time to serialize gal into /tmp/LTL14846397243320639534.gal : 3 ms
[2024-05-21 10:02:57] [INFO ] Time to serialize properties into /tmp/LTL1159717576509475828.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14846397243320639534.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10528109052338702835.hoa' '-atoms' '/tmp/LTL1159717576509475828.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1159717576509475828.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10528109052338702835.hoa
Detected timeout of ITS tools.
[2024-05-21 10:03:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:03:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 10:03:12] [INFO ] Time to serialize gal into /tmp/LTL6995309708262542222.gal : 2 ms
[2024-05-21 10:03:12] [INFO ] Time to serialize properties into /tmp/LTL3647533919630843283.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6995309708262542222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3647533919630843283.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p105==0)||(p328==0))"))))
Formula 0 simplified : FG!"((p105==0)||(p328==0))"
Detected timeout of ITS tools.
[2024-05-21 10:03:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:03:27] [INFO ] Applying decomposition
[2024-05-21 10:03:27] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4879765323829948930.txt' '-o' '/tmp/graph4879765323829948930.bin' '-w' '/tmp/graph4879765323829948930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4879765323829948930.bin' '-l' '-1' '-v' '-w' '/tmp/graph4879765323829948930.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:03:27] [INFO ] Decomposing Gal with order
[2024-05-21 10:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:03:27] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-21 10:03:27] [INFO ] Flatten gal took : 16 ms
[2024-05-21 10:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 10:03:27] [INFO ] Time to serialize gal into /tmp/LTL17276319266411050959.gal : 4 ms
[2024-05-21 10:03:27] [INFO ] Time to serialize properties into /tmp/LTL753211488530628171.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17276319266411050959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL753211488530628171.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i9.i0.u30.p105==0)||(i9.i0.u49.p328==0))"))))
Formula 0 simplified : FG!"((i9.i0.u30.p105==0)||(i9.i0.u49.p328==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 48 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.254267,24444,1,0,13909,12572,1661,13395,1051,36338,20960
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-24a-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24a-LTLFireability-10 finished in 133980 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&&X(G(p1)))))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Applied a total of 46 rules in 183 ms. Remains 492 /515 variables (removed 23) and now considering 437/460 (removed 23) transitions.
// Phase 1: matrix 437 rows 492 cols
[2024-05-21 10:03:28] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 10:03:28] [INFO ] Implicit Places using invariants in 344 ms returned [19, 38, 93, 112, 179, 196, 405, 491]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 345 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/515 places, 437/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 436
Applied a total of 2 rules in 15 ms. Remains 483 /484 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 483 cols
[2024-05-21 10:03:28] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 10:03:28] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-21 10:03:28] [INFO ] Invariant cache hit.
[2024-05-21 10:03:29] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 483/515 places, 436/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1522 ms. Remains : 483/515 places, 436/460 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1369 steps with 15 reset in 10 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-11 finished in 1700 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&&X(F(p1))) U (G((!p0&&F(p1)))||(!p0&&X((!p1&&F(p1)))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 514 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 459
Applied a total of 2 rules in 28 ms. Remains 514 /515 variables (removed 1) and now considering 459/460 (removed 1) transitions.
// Phase 1: matrix 459 rows 514 cols
[2024-05-21 10:03:29] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 10:03:30] [INFO ] Implicit Places using invariants in 499 ms returned [38, 93, 112, 179, 196, 427, 513]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 500 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 507/515 places, 459/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 506 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 506 transition count 458
Applied a total of 2 rules in 27 ms. Remains 506 /507 variables (removed 1) and now considering 458/459 (removed 1) transitions.
// Phase 1: matrix 458 rows 506 cols
[2024-05-21 10:03:30] [INFO ] Computed 74 invariants in 6 ms
[2024-05-21 10:03:30] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-21 10:03:30] [INFO ] Invariant cache hit.
[2024-05-21 10:03:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 10:03:31] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 506/515 places, 458/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1733 ms. Remains : 506/515 places, 458/460 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-12
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-12 finished in 2032 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 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 512 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 512 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 511 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 511 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 510 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 510 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 509 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 509 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 508 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 508 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 507 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 507 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 506 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 506 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 505 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 505 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 504 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 504 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 503 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 503 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 502 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 502 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 501 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 501 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 500 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 500 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 499 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 499 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 498 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 498 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 497 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 497 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 496 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 496 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 495 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 495 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 494 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 494 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 493 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 493 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 492 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 492 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 491 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 491 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 490 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 490 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 489 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 489 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 488 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 488 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 487 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 487 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 486 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 486 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 485 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 485 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 484 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 484 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 483 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 483 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 482 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 482 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 481 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 481 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 480 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 480 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 479 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 479 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 478 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 478 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 477 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 477 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 476 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 476 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 475 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 475 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 474 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 474 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 473 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 473 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 472 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 472 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 471 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 470 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 469 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 469 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 468 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 468 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 467 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 467 transition count 412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 466 transition count 411
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 466 transition count 411
Applied a total of 98 rules in 633 ms. Remains 466 /515 variables (removed 49) and now considering 411/460 (removed 49) transitions.
// Phase 1: matrix 411 rows 466 cols
[2024-05-21 10:03:32] [INFO ] Computed 81 invariants in 4 ms
[2024-05-21 10:03:32] [INFO ] Implicit Places using invariants in 422 ms returned [19, 38, 93, 112, 179, 196, 379, 465]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 428 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/515 places, 411/460 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 456 transition count 409
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 435 transition count 388
Applied a total of 46 rules in 243 ms. Remains 435 /458 variables (removed 23) and now considering 388/411 (removed 23) transitions.
// Phase 1: matrix 388 rows 435 cols
[2024-05-21 10:03:33] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 10:03:33] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-21 10:03:33] [INFO ] Invariant cache hit.
[2024-05-21 10:03:34] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/515 places, 388/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2469 ms. Remains : 435/515 places, 388/460 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-13 finished in 2655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p1||G(p2)))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 266 place count 382 transition count 267
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 386 place count 322 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 388 place count 320 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 319 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 319 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 318 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 498 place count 266 transition count 211
Applied a total of 498 rules in 76 ms. Remains 266 /515 variables (removed 249) and now considering 211/460 (removed 249) transitions.
// Phase 1: matrix 211 rows 266 cols
[2024-05-21 10:03:34] [INFO ] Computed 81 invariants in 1 ms
[2024-05-21 10:03:35] [INFO ] Implicit Places using invariants in 606 ms returned [13, 26, 65, 78, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 198, 265]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 622 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/515 places, 211/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 235 transition count 179
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 203 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 202 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 202 transition count 178
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 2 with 4 rules applied. Total rules applied 70 place count 200 transition count 176
Applied a total of 70 rules in 13 ms. Remains 200 /235 variables (removed 35) and now considering 176/211 (removed 35) transitions.
// Phase 1: matrix 176 rows 200 cols
[2024-05-21 10:03:35] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 10:03:35] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 10:03:35] [INFO ] Invariant cache hit.
[2024-05-21 10:03:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 10:03:35] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 200/515 places, 176/460 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1430 ms. Remains : 200/515 places, 176/460 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3562 steps with 65 reset in 63 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-15 finished in 1732 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)))'
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(X((G(F(!p0))||(F(!p0)&&F(G(!p1))))))))'
Found a Shortening insensitive property : AutoFlight-PT-24a-LTLFireability-09
Stuttering acceptance computed with spot in 316 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 515/515 places, 460/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 515 transition count 327
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 382 transition count 327
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 266 place count 382 transition count 265
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 390 place count 320 transition count 265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 392 place count 318 transition count 263
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 318 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 317 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 317 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 316 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 316 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 315 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 315 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 314 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 314 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 313 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 313 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 405 place count 312 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 312 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 407 place count 311 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 311 transition count 256
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 502 place count 264 transition count 209
Applied a total of 502 rules in 45 ms. Remains 264 /515 variables (removed 251) and now considering 209/460 (removed 251) transitions.
// Phase 1: matrix 209 rows 264 cols
[2024-05-21 10:03:36] [INFO ] Computed 81 invariants in 1 ms
[2024-05-21 10:03:37] [INFO ] Implicit Places using invariants in 367 ms returned [13, 27, 65, 78, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 128, 196, 263]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 369 ms to find 31 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 233/515 places, 209/460 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 233 transition count 178
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 202 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 202 transition count 177
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 64 place count 201 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 200 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 200 transition count 176
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 2 with 4 rules applied. Total rules applied 70 place count 198 transition count 174
Applied a total of 70 rules in 13 ms. Remains 198 /233 variables (removed 35) and now considering 174/209 (removed 35) transitions.
// Phase 1: matrix 174 rows 198 cols
[2024-05-21 10:03:37] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 10:03:37] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 10:03:37] [INFO ] Invariant cache hit.
[2024-05-21 10:03:37] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 10:03:38] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/515 places, 174/460 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1115 ms. Remains : 198/515 places, 174/460 transitions.
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-09
Product exploration explored 100000 steps with 1775 reset in 591 ms.
Product exploration explored 100000 steps with 1786 reset in 494 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 9580 steps (169 resets) in 48 ms. (195 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 329 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 10:03:40] [INFO ] Invariant cache hit.
[2024-05-21 10:03:40] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 10:03:40] [INFO ] Invariant cache hit.
[2024-05-21 10:03:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 10:03:41] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-21 10:03:41] [INFO ] Invariant cache hit.
[2024-05-21 10:03:41] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 10:03:43] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 15497 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 45582ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 45593ms
Finished structural reductions in LTL mode , in 1 iterations and 46281 ms. Remains : 198/198 places, 174/174 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 3906 steps (68 resets) in 69 ms. (55 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 346 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 348 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1825 reset in 530 ms.
Product exploration explored 100000 steps with 1773 reset in 400 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 296 ms :[p0, p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 10:04:29] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-21 10:04:29] [INFO ] Invariant cache hit.
[2024-05-21 10:04:29] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 10:04:32] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14795 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 44882ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 44885ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44904 ms. Remains : 198/198 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin14301730241968248092
[2024-05-21 10:05:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14301730241968248092
Running compilation step : cd /tmp/ltsmin14301730241968248092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 543 ms.
Running link step : cd /tmp/ltsmin14301730241968248092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14301730241968248092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9863026615908044947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 10:05:29] [INFO ] Invariant cache hit.
[2024-05-21 10:05:30] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 10:05:30] [INFO ] Invariant cache hit.
[2024-05-21 10:05:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 10:05:30] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-21 10:05:30] [INFO ] Invariant cache hit.
[2024-05-21 10:05:30] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 10:05:33] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 296 constraints, problems are : Problem set: 0 solved, 173 unsolved in 14112 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/372 variables, 198/249 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 47/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 173/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 469 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 1/1 constraints]
After SMT, in 44169ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 44172ms
Finished structural reductions in LTL mode , in 1 iterations and 44726 ms. Remains : 198/198 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin5226180950570123222
[2024-05-21 10:06:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5226180950570123222
Running compilation step : cd /tmp/ltsmin5226180950570123222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin5226180950570123222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5226180950570123222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5516297555940928297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:06:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 10:06:29] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:29] [INFO ] Time to serialize gal into /tmp/LTL10976680860916189399.gal : 2 ms
[2024-05-21 10:06:29] [INFO ] Time to serialize properties into /tmp/LTL4732841699486238719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10976680860916189399.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1566037509651153659.hoa' '-atoms' '/tmp/LTL4732841699486238719.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4732841699486238719.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1566037509651153659.hoa
Detected timeout of ITS tools.
[2024-05-21 10:06:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:06:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:44] [INFO ] Time to serialize gal into /tmp/LTL837266509205794585.gal : 1 ms
[2024-05-21 10:06:44] [INFO ] Time to serialize properties into /tmp/LTL8920623739178156146.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL837266509205794585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8920623739178156146.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((p237!=1)||(p597!=1))")))||((F("((p237!=1)||(p597!=1))"))&&(F(G("((p80!=1)&&(p40!=1))")))))))))
Formula 0 simplified : XXX(FG!"((p237!=1)||(p597!=1))" & (G!"((p237!=1)||(p597!=1))" | GF!"((p80!=1)&&(p40!=1))"))
Detected timeout of ITS tools.
[2024-05-21 10:06:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 10:06:59] [INFO ] Applying decomposition
[2024-05-21 10:06:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18422562876373793144.txt' '-o' '/tmp/graph18422562876373793144.bin' '-w' '/tmp/graph18422562876373793144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18422562876373793144.bin' '-l' '-1' '-v' '-w' '/tmp/graph18422562876373793144.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:06:59] [INFO ] Decomposing Gal with order
[2024-05-21 10:06:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:06:59] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-21 10:06:59] [INFO ] Flatten gal took : 24 ms
[2024-05-21 10:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 10:07:00] [INFO ] Time to serialize gal into /tmp/LTL4927003826544686342.gal : 4 ms
[2024-05-21 10:07:00] [INFO ] Time to serialize properties into /tmp/LTL13961962650317326956.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4927003826544686342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13961962650317326956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((i5.i0.u48.p237!=1)||(u68.p597!=1))")))||((F("((i5.i0.u48.p237!=1)||(u68.p597!=1))"))&&(F(G("((i2.u22.p80!=1)&&(i10.u1...175
Formula 0 simplified : XXX(FG!"((i5.i0.u48.p237!=1)||(u68.p597!=1))" & (G!"((i5.i0.u48.p237!=1)||(u68.p597!=1))" | GF!"((i2.u22.p80!=1)&&(i10.u11.p40!=1))"...157
Reverse transition relation is NOT exact ! Due to transitions t217_t216_t215_t214_t213_t212_t211_t210_t209_t208_t207_t206_t205_t204_t203_t202_t201_t200_t19...1168
Computing Next relation with stutter on 48 deadlock states
7 unique states visited
0 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
46 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.515533,33064,1,0,32850,16639,2448,25443,1164,55594,57909
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property AutoFlight-PT-24a-LTLFireability-09 finished in 204122 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-09 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-21 10:07:00] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5583828774564390537
[2024-05-21 10:07:00] [INFO ] Computing symmetric may disable matrix : 460 transitions.
[2024-05-21 10:07:00] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:07:00] [INFO ] Computing symmetric may enable matrix : 460 transitions.
[2024-05-21 10:07:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:07:00] [INFO ] Applying decomposition
[2024-05-21 10:07:00] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:07:00] [INFO ] Computing Do-Not-Accords matrix : 460 transitions.
[2024-05-21 10:07:00] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8138136254542078991.txt' '-o' '/tmp/graph8138136254542078991.bin' '-w' '/tmp/graph8138136254542078991.weights'
[2024-05-21 10:07:00] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5583828774564390537
Running compilation step : cd /tmp/ltsmin5583828774564390537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8138136254542078991.bin' '-l' '-1' '-v' '-w' '/tmp/graph8138136254542078991.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:07:00] [INFO ] Decomposing Gal with order
[2024-05-21 10:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:07:00] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-21 10:07:00] [INFO ] Flatten gal took : 62 ms
[2024-05-21 10:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 27 ms.
[2024-05-21 10:07:00] [INFO ] Time to serialize gal into /tmp/LTLFireability2110252659128298643.gal : 8 ms
[2024-05-21 10:07:00] [INFO ] Time to serialize properties into /tmp/LTLFireability9652147713104161184.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2110252659128298643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9652147713104161184.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i3.i0.u58.p199==0)||(i3.i0.u185.p524==0))"))))
Formula 0 simplified : GF!"((i3.i0.u58.p199==0)||(i3.i0.u185.p524==0))"
Compilation finished in 2085 ms.
Running link step : cd /tmp/ltsmin5583828774564390537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin5583828774564390537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t113, i0.i1.u1.t117, i1.i0.u7.t105, i1.i1.u9.t101, i2.i0.u11.t97, i2.i1.u13.t93, i3....932
Computing Next relation with stutter on 48 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15786 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,157.988,1890156,1,0,2.82689e+06,434,5142,9.01552e+06,256,1184,3646762
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1118226 ms.

BK_STOP 1716286399534

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutoFlight-PT-24a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-24a, 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 r026-smll-171620167100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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