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.r021-smll-171620127700018.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 gold2023
Input is ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 279K 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 ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716369646867

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 09:20:49] [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-22 09:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:20:50] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-22 09:20:50] [INFO ] Transformed 626 places.
[2024-05-22 09:20:50] [INFO ] Transformed 1008 transitions.
[2024-05-22 09:20:50] [INFO ] Found NUPN structural information;
[2024-05-22 09:20:50] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 998
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 609 transition count 982
Ensure Unique test removed 1 places
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 608 transition count 982
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 608 transition count 980
Applied a total of 26 rules in 146 ms. Remains 608 /626 variables (removed 18) and now considering 980/998 (removed 18) transitions.
// Phase 1: matrix 980 rows 608 cols
[2024-05-22 09:20:50] [INFO ] Computed 106 invariants in 100 ms
[2024-05-22 09:20:51] [INFO ] Implicit Places using invariants in 1200 ms returned [1, 23, 33, 51, 69, 198, 215, 220, 221, 222, 240, 258, 387, 392, 404, 409, 410, 411, 448, 451, 469, 470, 471, 472, 489, 497, 505, 511, 517, 523, 529, 537, 543, 549, 557]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1248 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 573/626 places, 980/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 560 transition count 967
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 560 transition count 967
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 550 transition count 957
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 550 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 545 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 545 transition count 952
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 543 transition count 950
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 543 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 541 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 541 transition count 948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 540 transition count 947
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 540 transition count 947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 539 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 539 transition count 946
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 538 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 538 transition count 945
Applied a total of 70 rules in 158 ms. Remains 538 /573 variables (removed 35) and now considering 945/980 (removed 35) transitions.
// Phase 1: matrix 945 rows 538 cols
[2024-05-22 09:20:51] [INFO ] Computed 71 invariants in 28 ms
[2024-05-22 09:20:52] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-22 09:20:52] [INFO ] Invariant cache hit.
[2024-05-22 09:20:54] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 2906 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 538/626 places, 945/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4460 ms. Remains : 538/626 places, 945/998 transitions.
Support contains 47 out of 538 places after structural reductions.
[2024-05-22 09:20:55] [INFO ] Flatten gal took : 157 ms
[2024-05-22 09:20:55] [INFO ] Flatten gal took : 97 ms
[2024-05-22 09:20:55] [INFO ] Input system was already deterministic with 945 transitions.
Support contains 45 out of 538 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-22 09:20:58] [INFO ] Invariant cache hit.
[2024-05-22 09:20:58] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-22 09:20:58] [INFO ] [Real]Absence check using 19 positive and 52 generalized place invariants in 33 ms returned sat
[2024-05-22 09:20:58] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 09:20:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-22 09:20:58] [INFO ] [Nat]Absence check using 19 positive and 52 generalized place invariants in 25 ms returned sat
[2024-05-22 09:21:02] [INFO ] After 3313ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :6
[2024-05-22 09:21:03] [INFO ] After 4624ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :6
Attempting to minimize the solution found.
Minimization took 324 ms.
[2024-05-22 09:21:04] [INFO ] After 5564ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :6
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 444 ms.
Support contains 14 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 945/945 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 538 transition count 862
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 455 transition count 862
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 166 place count 455 transition count 799
Deduced a syphon composed of 63 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 313 place count 371 transition count 799
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 315 place count 370 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 369 transition count 798
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 316 place count 369 transition count 790
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 332 place count 361 transition count 790
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 335 place count 358 transition count 779
Iterating global reduction 4 with 3 rules applied. Total rules applied 338 place count 358 transition count 779
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 355 place count 354 transition count 766
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 368 place count 341 transition count 766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 368 place count 341 transition count 765
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 370 place count 340 transition count 765
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 374 place count 336 transition count 754
Iterating global reduction 6 with 4 rules applied. Total rules applied 378 place count 336 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 381 place count 336 transition count 751
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 382 place count 335 transition count 743
Iterating global reduction 7 with 1 rules applied. Total rules applied 383 place count 335 transition count 743
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 384 place count 334 transition count 735
Iterating global reduction 7 with 1 rules applied. Total rules applied 385 place count 334 transition count 735
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 386 place count 333 transition count 727
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 333 transition count 727
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 388 place count 332 transition count 719
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 332 transition count 719
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 390 place count 331 transition count 711
Iterating global reduction 7 with 1 rules applied. Total rules applied 391 place count 331 transition count 711
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 392 place count 330 transition count 703
Iterating global reduction 7 with 1 rules applied. Total rules applied 393 place count 330 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 394 place count 329 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 395 place count 329 transition count 695
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 396 place count 328 transition count 687
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 328 transition count 687
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 398 place count 327 transition count 679
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 327 transition count 679
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 400 place count 326 transition count 671
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 326 transition count 671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 402 place count 325 transition count 663
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 325 transition count 663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 324 transition count 655
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 324 transition count 655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 323 transition count 647
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 323 transition count 647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 408 place count 322 transition count 639
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 322 transition count 639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 410 place count 321 transition count 631
Iterating global reduction 7 with 1 rules applied. Total rules applied 411 place count 321 transition count 631
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 465 place count 294 transition count 604
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 294 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 467 place count 293 transition count 603
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 478 place count 293 transition count 592
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 490 place count 281 transition count 592
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 491 place count 281 transition count 591
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 498 place count 281 transition count 591
Applied a total of 498 rules in 406 ms. Remains 281 /538 variables (removed 257) and now considering 591/945 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 281/538 places, 591/945 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 591 rows 281 cols
[2024-05-22 09:21:05] [INFO ] Computed 44 invariants in 8 ms
[2024-05-22 09:21:05] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 09:21:05] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-22 09:21:06] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 09:21:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 09:21:06] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-22 09:21:06] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 09:21:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 09:21:06] [INFO ] After 262ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 09:21:07] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-22 09:21:07] [INFO ] After 1313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 50 ms.
Support contains 12 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 591/591 transitions.
Applied a total of 0 rules in 14 ms. Remains 281 /281 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 281/281 places, 591/591 transitions.
Incomplete random walk after 10000 steps, including 206 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 09:21:07] [INFO ] Invariant cache hit.
[2024-05-22 09:21:07] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 09:21:07] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-05-22 09:21:07] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 09:21:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-22 09:21:07] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-05-22 09:21:08] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 09:21:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 09:21:08] [INFO ] After 55ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 09:21:08] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-22 09:21:08] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 591/591 transitions.
Applied a total of 0 rules in 16 ms. Remains 281 /281 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 281/281 places, 591/591 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Finished probabilistic random walk after 45357 steps, run visited all 2 properties in 303 ms. (steps per millisecond=149 )
Probabilistic random walk after 45357 steps, saw 29934 distinct states, run finished after 304 ms. (steps per millisecond=149 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-02a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Applied a total of 1 rules in 13 ms. Remains 537 /538 variables (removed 1) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 537 cols
[2024-05-22 09:21:09] [INFO ] Computed 70 invariants in 13 ms
[2024-05-22 09:21:10] [INFO ] Implicit Places using invariants in 551 ms returned [18, 19, 427]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 552 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 534/538 places, 945/945 transitions.
Applied a total of 0 rules in 10 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 534/538 places, 945/945 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p1), acceptance={1} source=3 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={1} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=5 dest: 5}, { cond=(AND p3 (NOT p1) p2), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p1 p2), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s361 0), p1:(AND (EQ s391 1) (EQ s502 1)), p3:(AND (EQ s15 1) (EQ s77 1)), p2:(AND (EQ s379 1) (EQ s440 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1484 reset in 464 ms.
Product exploration explored 100000 steps with 1485 reset in 401 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 945 rows 534 cols
[2024-05-22 09:21:12] [INFO ] Computed 67 invariants in 8 ms
[2024-05-22 09:21:13] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 09:21:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-22 09:21:13] [INFO ] [Nat]Absence check using 18 positive and 49 generalized place invariants in 26 ms returned sat
[2024-05-22 09:21:23] [INFO ] After 9849ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 09:21:23] [INFO ] After 10423ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 307 ms.
[2024-05-22 09:21:24] [INFO ] After 10986ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 945/945 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 855
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 444 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 443 transition count 854
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 182 place count 443 transition count 790
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 331 place count 358 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 333 place count 357 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 356 transition count 789
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 356 transition count 781
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 348 transition count 781
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 346 transition count 779
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 346 transition count 779
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 346 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 345 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 356 place count 345 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 344 transition count 777
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 436 place count 305 transition count 738
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 305 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 304 transition count 737
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 444 place count 304 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 450 place count 298 transition count 731
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 451 place count 298 transition count 730
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 462 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 297 transition count 729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 295 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 465 place count 295 transition count 725
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 475 place count 289 transition count 725
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 477 place count 287 transition count 723
Iterating global reduction 10 with 2 rules applied. Total rules applied 479 place count 287 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 287 transition count 721
Applied a total of 481 rules in 262 ms. Remains 287 /534 variables (removed 247) and now considering 721/945 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 287/534 places, 721/945 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 464878 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 464878 steps, saw 187797 distinct states, run finished after 3006 ms. (steps per millisecond=154 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 287 cols
[2024-05-22 09:21:28] [INFO ] Computed 41 invariants in 18 ms
[2024-05-22 09:21:28] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-22 09:21:28] [INFO ] [Real]Absence check using 11 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-22 09:21:29] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:21:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 09:21:29] [INFO ] [Nat]Absence check using 11 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-22 09:21:29] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:21:29] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-22 09:21:29] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 719
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 719
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 284 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 283 transition count 718
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 283 transition count 717
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 282 transition count 716
Applied a total of 10 rules in 70 ms. Remains 282 /287 variables (removed 5) and now considering 716/721 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 282/287 places, 716/721 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468562 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468562 steps, saw 216816 distinct states, run finished after 3006 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 716 rows 282 cols
[2024-05-22 09:21:33] [INFO ] Computed 40 invariants in 12 ms
[2024-05-22 09:21:33] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-22 09:21:33] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 16 ms returned sat
[2024-05-22 09:21:33] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:21:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-22 09:21:33] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-22 09:21:34] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:21:34] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 09:21:34] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 20 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 282/282 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 20 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-22 09:21:34] [INFO ] Invariant cache hit.
[2024-05-22 09:21:34] [INFO ] Implicit Places using invariants in 497 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 266, 269, 273, 276, 279]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 500 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 263/282 places, 716/716 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 263 transition count 712
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 259 transition count 712
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 17 place count 250 transition count 701
Iterating global reduction 2 with 9 rules applied. Total rules applied 26 place count 250 transition count 701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 250 transition count 699
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 248 transition count 697
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 248 transition count 697
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 42 place count 243 transition count 692
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 49 place count 243 transition count 685
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 56 place count 236 transition count 685
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 236 transition count 683
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 60 place count 234 transition count 683
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 234 transition count 683
Applied a total of 61 rules in 88 ms. Remains 234 /263 variables (removed 29) and now considering 683/716 (removed 33) transitions.
// Phase 1: matrix 683 rows 234 cols
[2024-05-22 09:21:35] [INFO ] Computed 21 invariants in 8 ms
[2024-05-22 09:21:35] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-22 09:21:35] [INFO ] Invariant cache hit.
[2024-05-22 09:21:36] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 234/282 places, 683/716 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1858 ms. Remains : 234/282 places, 683/716 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 531611 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 531611 steps, saw 311107 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 09:21:39] [INFO ] Invariant cache hit.
[2024-05-22 09:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:21:39] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-22 09:21:39] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:21:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-22 09:21:39] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-22 09:21:40] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:21:40] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-22 09:21:40] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 683/683 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 234/234 places, 683/683 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 683/683 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 683/683 (removed 0) transitions.
[2024-05-22 09:21:40] [INFO ] Invariant cache hit.
[2024-05-22 09:21:40] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-22 09:21:40] [INFO ] Invariant cache hit.
[2024-05-22 09:21:41] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2024-05-22 09:21:41] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-22 09:21:41] [INFO ] Invariant cache hit.
[2024-05-22 09:21:41] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1716 ms. Remains : 234/234 places, 683/683 transitions.
Applied a total of 0 rules in 9 ms. Remains 234 /234 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 09:21:41] [INFO ] Invariant cache hit.
[2024-05-22 09:21:41] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-22 09:21:41] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-22 09:21:42] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:21:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-22 09:21:42] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-22 09:21:42] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:21:42] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 09:21:42] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 p3 p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p1 p3 (NOT p2))), (F (AND (NOT p1) p3)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 455 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 945/945 transitions.
Applied a total of 0 rules in 10 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 534 cols
[2024-05-22 09:21:43] [INFO ] Computed 67 invariants in 8 ms
[2024-05-22 09:21:44] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-22 09:21:44] [INFO ] Invariant cache hit.
[2024-05-22 09:21:45] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2024-05-22 09:21:45] [INFO ] Invariant cache hit.
[2024-05-22 09:21:46] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2718 ms. Remains : 534/534 places, 945/945 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 09:21:47] [INFO ] Invariant cache hit.
[2024-05-22 09:21:47] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 09:21:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-22 09:21:48] [INFO ] [Nat]Absence check using 18 positive and 49 generalized place invariants in 22 ms returned sat
[2024-05-22 09:22:06] [INFO ] After 18770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 09:22:07] [INFO ] After 19409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 330 ms.
[2024-05-22 09:22:07] [INFO ] After 19951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 505 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 945/945 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 855
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 444 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 443 transition count 854
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 182 place count 443 transition count 790
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 331 place count 358 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 333 place count 357 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 356 transition count 789
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 356 transition count 781
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 348 transition count 781
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 346 transition count 779
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 346 transition count 779
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 346 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 345 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 356 place count 345 transition count 777
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 344 transition count 777
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 436 place count 305 transition count 738
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 305 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 304 transition count 737
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 444 place count 304 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 450 place count 298 transition count 731
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 451 place count 298 transition count 730
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 462 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 297 transition count 729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 295 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 465 place count 295 transition count 725
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 475 place count 289 transition count 725
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 477 place count 287 transition count 723
Iterating global reduction 10 with 2 rules applied. Total rules applied 479 place count 287 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 287 transition count 721
Applied a total of 481 rules in 113 ms. Remains 287 /534 variables (removed 247) and now considering 721/945 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 287/534 places, 721/945 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 426650 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 426650 steps, saw 176279 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 721 rows 287 cols
[2024-05-22 09:22:12] [INFO ] Computed 41 invariants in 6 ms
[2024-05-22 09:22:12] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-22 09:22:12] [INFO ] [Real]Absence check using 11 positive and 30 generalized place invariants in 18 ms returned sat
[2024-05-22 09:22:12] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:22:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 09:22:12] [INFO ] [Nat]Absence check using 11 positive and 30 generalized place invariants in 13 ms returned sat
[2024-05-22 09:22:13] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:22:13] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 09:22:13] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 719
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 719
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 284 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 282 transition count 717
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 282 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 12 place count 281 transition count 715
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 17 place count 281 transition count 710
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 27 place count 271 transition count 710
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 31 place count 267 transition count 698
Iterating global reduction 5 with 4 rules applied. Total rules applied 35 place count 267 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 38 place count 267 transition count 695
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 39 place count 266 transition count 687
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 266 transition count 687
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 41 place count 265 transition count 679
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 265 transition count 679
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 43 place count 264 transition count 671
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 264 transition count 671
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 45 place count 263 transition count 663
Iterating global reduction 6 with 1 rules applied. Total rules applied 46 place count 263 transition count 663
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 47 place count 262 transition count 655
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 262 transition count 655
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 49 place count 261 transition count 647
Iterating global reduction 6 with 1 rules applied. Total rules applied 50 place count 261 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 51 place count 260 transition count 639
Iterating global reduction 6 with 1 rules applied. Total rules applied 52 place count 260 transition count 639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 53 place count 259 transition count 631
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 259 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 55 place count 258 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 258 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 57 place count 257 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 58 place count 257 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 59 place count 256 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 256 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 255 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 255 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 254 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 254 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 253 transition count 583
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 253 transition count 583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 67 place count 252 transition count 575
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 252 transition count 575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 251 transition count 567
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 251 transition count 567
Applied a total of 70 rules in 116 ms. Remains 251 /287 variables (removed 36) and now considering 567/721 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 251/287 places, 567/721 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 535902 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 535902 steps, saw 217789 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 251 cols
[2024-05-22 09:22:16] [INFO ] Computed 35 invariants in 5 ms
[2024-05-22 09:22:16] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 09:22:16] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 09:22:16] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:22:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 09:22:16] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 09:22:16] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:22:17] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 09:22:17] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 567/567 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 251/251 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2024-05-22 09:22:17] [INFO ] Invariant cache hit.
[2024-05-22 09:22:17] [INFO ] Implicit Places using invariants in 352 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 354 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 237/251 places, 567/567 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 230 transition count 560
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 230 transition count 560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 228 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 228 transition count 558
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 224 transition count 554
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 224 transition count 548
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 218 transition count 548
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 218 transition count 546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 216 transition count 546
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 216 transition count 546
Applied a total of 43 rules in 44 ms. Remains 216 /237 variables (removed 21) and now considering 546/567 (removed 21) transitions.
// Phase 1: matrix 546 rows 216 cols
[2024-05-22 09:22:17] [INFO ] Computed 21 invariants in 5 ms
[2024-05-22 09:22:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-22 09:22:17] [INFO ] Invariant cache hit.
[2024-05-22 09:22:18] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 216/251 places, 546/567 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1299 ms. Remains : 216/251 places, 546/567 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 574163 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574163 steps, saw 310588 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 09:22:21] [INFO ] Invariant cache hit.
[2024-05-22 09:22:21] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-22 09:22:21] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:22:21] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:22:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-22 09:22:21] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-22 09:22:21] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:22:22] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 09:22:22] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 546/546 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 216/216 places, 546/546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 546/546 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2024-05-22 09:22:22] [INFO ] Invariant cache hit.
[2024-05-22 09:22:22] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 09:22:22] [INFO ] Invariant cache hit.
[2024-05-22 09:22:22] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-05-22 09:22:22] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 09:22:22] [INFO ] Invariant cache hit.
[2024-05-22 09:22:23] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1190 ms. Remains : 216/216 places, 546/546 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 09:22:23] [INFO ] Invariant cache hit.
[2024-05-22 09:22:23] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-22 09:22:23] [INFO ] [Real]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-22 09:22:23] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 09:22:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-22 09:22:23] [INFO ] [Nat]Absence check using 7 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-22 09:22:23] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 09:22:23] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 09:22:23] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1) p3)), (F p2), (F (AND (NOT p1) p3)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p3)), (F (AND (NOT p1) p3 (NOT p2)))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Product exploration explored 100000 steps with 1485 reset in 250 ms.
Product exploration explored 100000 steps with 1532 reset in 253 ms.
Built C files in :
/tmp/ltsmin795455812170631730
[2024-05-22 09:22:26] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin795455812170631730
Running compilation step : cd /tmp/ltsmin795455812170631730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2895 ms.
Running link step : cd /tmp/ltsmin795455812170631730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin795455812170631730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5661899051007644184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 945/945 transitions.
Applied a total of 0 rules in 13 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 534 cols
[2024-05-22 09:22:41] [INFO ] Computed 67 invariants in 9 ms
[2024-05-22 09:22:41] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-22 09:22:41] [INFO ] Invariant cache hit.
[2024-05-22 09:22:43] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2024-05-22 09:22:43] [INFO ] Invariant cache hit.
[2024-05-22 09:22:44] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2701 ms. Remains : 534/534 places, 945/945 transitions.
Built C files in :
/tmp/ltsmin14795975690358651081
[2024-05-22 09:22:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14795975690358651081
Running compilation step : cd /tmp/ltsmin14795975690358651081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2626 ms.
Running link step : cd /tmp/ltsmin14795975690358651081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14795975690358651081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5393282270014131736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 09:22:59] [INFO ] Flatten gal took : 68 ms
[2024-05-22 09:22:59] [INFO ] Flatten gal took : 59 ms
[2024-05-22 09:22:59] [INFO ] Time to serialize gal into /tmp/LTL7135922428018155224.gal : 10 ms
[2024-05-22 09:22:59] [INFO ] Time to serialize properties into /tmp/LTL1995576433489932328.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7135922428018155224.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9585982936616703094.hoa' '-atoms' '/tmp/LTL1995576433489932328.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1995576433489932328.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9585982936616703094.hoa
Detected timeout of ITS tools.
[2024-05-22 09:23:14] [INFO ] Flatten gal took : 113 ms
[2024-05-22 09:23:14] [INFO ] Flatten gal took : 103 ms
[2024-05-22 09:23:14] [INFO ] Time to serialize gal into /tmp/LTL11551732466226181975.gal : 23 ms
[2024-05-22 09:23:14] [INFO ] Time to serialize properties into /tmp/LTL13386104941349578758.ltl : 5 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11551732466226181975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13386104941349578758.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(p386==0)"))||(G(F((!("((p425==1)&&(p593==1))"))U((G(!("((p425==1)&&(p593==1))")))||((!("((p425==1)&&(p593==1))"))&&((X(!("...294
Formula 0 simplified : XX(F!"(p386==0)" & FG((X"((p408==1)&&(p477==1))" R (XF"((p408==1)&&(p477==1))" & ("((p16==1)&&(p87==1))" | X"((p408==1)&&(p477==1))"...187
Detected timeout of ITS tools.
[2024-05-22 09:23:30] [INFO ] Flatten gal took : 69 ms
[2024-05-22 09:23:30] [INFO ] Applying decomposition
[2024-05-22 09:23:30] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11099665054800527393.txt' '-o' '/tmp/graph11099665054800527393.bin' '-w' '/tmp/graph11099665054800527393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11099665054800527393.bin' '-l' '-1' '-v' '-w' '/tmp/graph11099665054800527393.weights' '-q' '0' '-e' '0.001'
[2024-05-22 09:23:30] [INFO ] Decomposing Gal with order
[2024-05-22 09:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 09:23:30] [INFO ] Removed a total of 1487 redundant transitions.
[2024-05-22 09:23:31] [INFO ] Flatten gal took : 407 ms
[2024-05-22 09:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 58 ms.
[2024-05-22 09:23:31] [INFO ] Time to serialize gal into /tmp/LTL7537609897838118768.gal : 43 ms
[2024-05-22 09:23:31] [INFO ] Time to serialize properties into /tmp/LTL9307201803363766763.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7537609897838118768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9307201803363766763.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(i7.i1.i1.u112.p386==0)"))||(G(F((!("((i8.u120.p425==1)&&(i10.u160.p593==1))"))U((G(!("((i8.u120.p425==1)&&(i10.u160.p593==...420
Formula 0 simplified : XX(F!"(i7.i1.i1.u112.p386==0)" & FG((X"((i9.u116.p408==1)&&(i9.u139.p477==1))" R (XF"((i9.u116.p408==1)&&(i9.u139.p477==1))" & ("((i...279
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18090344425537907181
[2024-05-22 09:23:46] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18090344425537907181
Running compilation step : cd /tmp/ltsmin18090344425537907181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2615 ms.
Running link step : cd /tmp/ltsmin18090344425537907181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18090344425537907181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||[](<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(X(!(LTLAPp2==true)) U (X([](!(LTLAPp2==true)))||(!(LTLAPp3==true)&&X(!(LTLAPp2==true)))))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-02a-LTLFireability-00 finished in 172009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 5 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 7 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 8 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 8 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 8 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 8 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 8 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 8 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 510 place count 268 transition count 583
Applied a total of 510 rules in 170 ms. Remains 268 /538 variables (removed 270) and now considering 583/945 (removed 362) transitions.
// Phase 1: matrix 583 rows 268 cols
[2024-05-22 09:24:01] [INFO ] Computed 38 invariants in 4 ms
[2024-05-22 09:24:01] [INFO ] Implicit Places using invariants in 339 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 265]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 347 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/538 places, 583/945 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 253 transition count 581
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 253 transition count 579
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 251 transition count 579
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 247 transition count 575
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 247 transition count 575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 243 transition count 571
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 243 transition count 571
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 241 transition count 569
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 241 transition count 569
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 230 transition count 558
Applied a total of 50 rules in 51 ms. Remains 230 /255 variables (removed 25) and now considering 558/583 (removed 25) transitions.
// Phase 1: matrix 558 rows 230 cols
[2024-05-22 09:24:01] [INFO ] Computed 25 invariants in 5 ms
[2024-05-22 09:24:02] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-22 09:24:02] [INFO ] Invariant cache hit.
[2024-05-22 09:24:02] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/538 places, 558/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1492 ms. Remains : 230/538 places, 558/945 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-01 finished in 1555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1))&&X(G(!p2))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 177 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 520 cols
[2024-05-22 09:24:03] [INFO ] Computed 70 invariants in 7 ms
[2024-05-22 09:24:03] [INFO ] Implicit Places using invariants in 455 ms returned [19, 410]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 462 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 518/538 places, 808/945 transitions.
Applied a total of 0 rules in 11 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 651 ms. Remains : 518/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), p2, (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s18 1) (EQ s22 1)), p0:(EQ s342 1), p1:(AND (EQ s383 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-03 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 187 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
[2024-05-22 09:24:03] [INFO ] Invariant cache hit.
[2024-05-22 09:24:04] [INFO ] Implicit Places using invariants in 391 ms returned [18, 19, 410]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 394 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/538 places, 808/945 transitions.
Applied a total of 0 rules in 10 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 517/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-07 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 536 transition count 857
Reduce places removed 89 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 179 place count 447 transition count 855
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 445 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 6 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 8 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 9 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 508 place count 269 transition count 584
Applied a total of 508 rules in 155 ms. Remains 269 /538 variables (removed 269) and now considering 584/945 (removed 361) transitions.
// Phase 1: matrix 584 rows 269 cols
[2024-05-22 09:24:04] [INFO ] Computed 38 invariants in 5 ms
[2024-05-22 09:24:04] [INFO ] Implicit Places using invariants in 355 ms returned [17, 18, 77, 94, 100, 106, 165, 182, 188, 193, 195, 224, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 361 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/538 places, 584/945 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 256 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 254 transition count 580
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 8 place count 252 transition count 580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 248 transition count 576
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 248 transition count 576
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 244 transition count 572
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 244 transition count 572
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 242 transition count 570
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 242 transition count 570
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 231 transition count 559
Applied a total of 50 rules in 30 ms. Remains 231 /256 variables (removed 25) and now considering 559/584 (removed 25) transitions.
// Phase 1: matrix 559 rows 231 cols
[2024-05-22 09:24:05] [INFO ] Computed 25 invariants in 6 ms
[2024-05-22 09:24:05] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-22 09:24:05] [INFO ] Invariant cache hit.
[2024-05-22 09:24:06] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/538 places, 559/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1544 ms. Remains : 231/538 places, 559/945 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s89 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2174 reset in 230 ms.
Stack based approach found an accepted trace after 33467 steps with 710 reset with depth 64 and stack size 64 in 111 ms.
FORMULA ASLink-PT-02a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-09 finished in 1943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 183 place count 444 transition count 787
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 338 place count 356 transition count 787
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 348 place count 351 transition count 782
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 346 transition count 782
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 353 place count 346 transition count 773
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 371 place count 337 transition count 773
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 376 place count 332 transition count 760
Iterating global reduction 5 with 5 rules applied. Total rules applied 381 place count 332 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 15 rules applied. Total rules applied 396 place count 328 transition count 749
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 13 rules applied. Total rules applied 409 place count 319 transition count 745
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 413 place count 315 transition count 745
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 413 place count 315 transition count 744
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 415 place count 314 transition count 744
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 419 place count 310 transition count 733
Iterating global reduction 8 with 4 rules applied. Total rules applied 423 place count 310 transition count 733
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 426 place count 310 transition count 730
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 427 place count 309 transition count 722
Iterating global reduction 9 with 1 rules applied. Total rules applied 428 place count 309 transition count 722
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 714
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 714
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 706
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 706
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 698
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 698
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 690
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 690
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 682
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 682
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 674
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 674
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 666
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 666
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 658
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 658
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 650
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 650
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 642
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 642
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 634
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 634
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 626
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 626
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 618
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 618
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 610
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 610
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 506 place count 270 transition count 585
Applied a total of 506 rules in 139 ms. Remains 270 /538 variables (removed 268) and now considering 585/945 (removed 360) transitions.
// Phase 1: matrix 585 rows 270 cols
[2024-05-22 09:24:06] [INFO ] Computed 38 invariants in 4 ms
[2024-05-22 09:24:06] [INFO ] Implicit Places using invariants in 322 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 325 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/538 places, 585/945 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 255 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 255 transition count 581
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 8 place count 253 transition count 581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 249 transition count 577
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 249 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 245 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 245 transition count 573
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 243 transition count 571
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 243 transition count 571
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 232 transition count 560
Applied a total of 50 rules in 35 ms. Remains 232 /257 variables (removed 25) and now considering 560/585 (removed 25) transitions.
// Phase 1: matrix 560 rows 232 cols
[2024-05-22 09:24:06] [INFO ] Computed 25 invariants in 4 ms
[2024-05-22 09:24:07] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 09:24:07] [INFO ] Invariant cache hit.
[2024-05-22 09:24:07] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/538 places, 560/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1469 ms. Remains : 232/538 places, 560/945 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s218 0), p1:(OR (NEQ s115 1) (NEQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2273 reset in 172 ms.
Stack based approach found an accepted trace after 98614 steps with 2191 reset with depth 161 and stack size 161 in 193 ms.
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-11 finished in 2028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 8 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 537 transition count 936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 537 transition count 936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 536 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 536 transition count 928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 535 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 535 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 534 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 534 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 533 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 533 transition count 904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 532 transition count 896
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 532 transition count 896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 531 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 530 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 530 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 529 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 529 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 528 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 528 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 527 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 527 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 526 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 526 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 525 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 525 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 524 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 524 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 523 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 523 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 522 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 522 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 521 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 521 transition count 808
Applied a total of 34 rules in 171 ms. Remains 521 /538 variables (removed 17) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 521 cols
[2024-05-22 09:24:08] [INFO ] Computed 71 invariants in 6 ms
[2024-05-22 09:24:09] [INFO ] Implicit Places using invariants in 451 ms returned [18, 411]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 453 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/538 places, 808/945 transitions.
Applied a total of 0 rules in 9 ms. Remains 519 /519 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 633 ms. Remains : 519/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s180 0) (EQ s207 0) (EQ s18 0) (EQ s25 0)), p2:(AND (NOT (AND (EQ s37 1) (EQ s253 1))) (EQ s327 1) (EQ s385 1)), p1:(AND (EQ s37 1) (EQ s253 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-13 finished in 2355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 537 transition count 857
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 449 transition count 857
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 177 place count 449 transition count 794
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 323 place count 366 transition count 794
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 326 place count 364 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 363 transition count 793
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 327 place count 363 transition count 785
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 343 place count 355 transition count 785
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 352 transition count 774
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 352 transition count 774
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 366 place count 348 transition count 761
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 379 place count 335 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 379 place count 335 transition count 760
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 334 transition count 760
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 385 place count 330 transition count 749
Iterating global reduction 6 with 4 rules applied. Total rules applied 389 place count 330 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 392 place count 330 transition count 746
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 329 transition count 738
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 329 transition count 738
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 328 transition count 730
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 328 transition count 730
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 397 place count 327 transition count 722
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 327 transition count 722
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 399 place count 326 transition count 714
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 326 transition count 714
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 401 place count 325 transition count 706
Iterating global reduction 7 with 1 rules applied. Total rules applied 402 place count 325 transition count 706
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 403 place count 324 transition count 698
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 324 transition count 698
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 405 place count 323 transition count 690
Iterating global reduction 7 with 1 rules applied. Total rules applied 406 place count 323 transition count 690
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 407 place count 322 transition count 682
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 322 transition count 682
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 409 place count 321 transition count 674
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 321 transition count 674
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 411 place count 320 transition count 666
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 320 transition count 666
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 413 place count 319 transition count 658
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 319 transition count 658
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 415 place count 318 transition count 650
Iterating global reduction 7 with 1 rules applied. Total rules applied 416 place count 318 transition count 650
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 417 place count 317 transition count 642
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 317 transition count 642
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 419 place count 316 transition count 634
Iterating global reduction 7 with 1 rules applied. Total rules applied 420 place count 316 transition count 634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 421 place count 315 transition count 626
Iterating global reduction 7 with 1 rules applied. Total rules applied 422 place count 315 transition count 626
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 472 place count 290 transition count 601
Applied a total of 472 rules in 130 ms. Remains 290 /538 variables (removed 248) and now considering 601/945 (removed 344) transitions.
// Phase 1: matrix 601 rows 290 cols
[2024-05-22 09:24:10] [INFO ] Computed 44 invariants in 4 ms
[2024-05-22 09:24:11] [INFO ] Implicit Places using invariants in 306 ms returned [18, 19, 95, 101, 106, 122, 193, 199, 204, 224, 242, 284, 287]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 317 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/538 places, 601/945 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 599
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 275 transition count 594
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 270 transition count 594
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 269 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 269 transition count 593
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 268 transition count 593
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 263 transition count 588
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 263 transition count 588
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 31 place count 259 transition count 584
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 259 transition count 584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 257 transition count 582
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 257 transition count 582
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 245 transition count 570
Applied a total of 63 rules in 38 ms. Remains 245 /277 variables (removed 32) and now considering 570/601 (removed 31) transitions.
// Phase 1: matrix 570 rows 245 cols
[2024-05-22 09:24:11] [INFO ] Computed 30 invariants in 4 ms
[2024-05-22 09:24:11] [INFO ] Implicit Places using invariants in 251 ms returned [94, 177, 180]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 263 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/538 places, 570/945 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 238 transition count 566
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 238 transition count 566
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 238 transition count 564
Applied a total of 10 rules in 16 ms. Remains 238 /242 variables (removed 4) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 238 cols
[2024-05-22 09:24:11] [INFO ] Computed 27 invariants in 4 ms
[2024-05-22 09:24:11] [INFO ] Implicit Places using invariants in 246 ms returned [73, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 256 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/538 places, 564/945 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 562
Applied a total of 4 rules in 11 ms. Remains 234 /236 variables (removed 2) and now considering 562/564 (removed 2) transitions.
// Phase 1: matrix 562 rows 234 cols
[2024-05-22 09:24:11] [INFO ] Computed 25 invariants in 4 ms
[2024-05-22 09:24:12] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 09:24:12] [INFO ] Invariant cache hit.
[2024-05-22 09:24:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 09:24:12] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 234/538 places, 562/945 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1968 ms. Remains : 234/538 places, 562/945 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s233 0), p0:(EQ s149 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 76 steps with 3 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-15 finished in 2068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
[2024-05-22 09:24:13] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17427752817385869635
[2024-05-22 09:24:13] [INFO ] Computing symmetric may disable matrix : 945 transitions.
[2024-05-22 09:24:13] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 09:24:13] [INFO ] Applying decomposition
[2024-05-22 09:24:13] [INFO ] Computing symmetric may enable matrix : 945 transitions.
[2024-05-22 09:24:13] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 09:24:13] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11176149828908173752.txt' '-o' '/tmp/graph11176149828908173752.bin' '-w' '/tmp/graph11176149828908173752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11176149828908173752.bin' '-l' '-1' '-v' '-w' '/tmp/graph11176149828908173752.weights' '-q' '0' '-e' '0.001'
[2024-05-22 09:24:13] [INFO ] Decomposing Gal with order
[2024-05-22 09:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 09:24:13] [INFO ] Computing Do-Not-Accords matrix : 945 transitions.
[2024-05-22 09:24:13] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 09:24:13] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17427752817385869635
Running compilation step : cd /tmp/ltsmin17427752817385869635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 09:24:13] [INFO ] Removed a total of 1481 redundant transitions.
[2024-05-22 09:24:13] [INFO ] Flatten gal took : 197 ms
[2024-05-22 09:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 63 ms.
[2024-05-22 09:24:13] [INFO ] Time to serialize gal into /tmp/LTLFireability9127846845495567746.gal : 26 ms
[2024-05-22 09:24:13] [INFO ] Time to serialize properties into /tmp/LTLFireability11529434399814083984.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9127846845495567746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11529434399814083984.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(i7.i1.i0.u113.p386==0)"))||(G(F((!("((i4.u122.p425==1)&&(i11.u160.p593==1))"))U((G(!("((i4.u122.p425==1)&&(i11.u160.p593==...420
Formula 0 simplified : XX(F!"(i7.i1.i0.u113.p386==0)" & FG((X"((i8.u117.p408==1)&&(i8.u142.p477==1))" R (XF"((i8.u117.p408==1)&&(i8.u142.p477==1))" & ("((i...279
Compilation finished in 4529 ms.
Running link step : cd /tmp/ltsmin17427752817385869635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin17427752817385869635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||[](<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t8, t9, t16, t463, t465, t789, t842, t865, t918, i1.t5, i2.t4, i3.u40.t99...486
Computing Next relation with stutter on 2.10753e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-22 09:45:22] [INFO ] Applying decomposition
[2024-05-22 09:45:22] [INFO ] Flatten gal took : 139 ms
[2024-05-22 09:45:22] [INFO ] Decomposing Gal with order
[2024-05-22 09:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 09:45:22] [INFO ] Removed a total of 1198 redundant transitions.
[2024-05-22 09:45:22] [INFO ] Flatten gal took : 240 ms
[2024-05-22 09:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 27 ms.
[2024-05-22 09:45:22] [INFO ] Time to serialize gal into /tmp/LTLFireability1647278275238468387.gal : 6 ms
[2024-05-22 09:45:22] [INFO ] Time to serialize properties into /tmp/LTLFireability17721087589111489196.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1647278275238468387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17721087589111489196.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(i14.u63.p386==0)"))||(G(F((!("((u74.p425==1)&&(i21.u105.p593==1))"))U((G(!("((u74.p425==1)&&(i21.u105.p593==1))")))||((!("...371
Formula 0 simplified : XX(F!"(i14.u63.p386==0)" & FG((X"((u70.p408==1)&&(u75.p477==1))" R (XF"((u70.p408==1)&&(u75.p477==1))" & ("((u1.p16==1)&&(u6.p87==1)...238
Reverse transition relation is NOT exact ! Due to transitions t417, t745, t755, t756, t759, t761, t764, t776, t780, t789, t839, t865, t918, i6.t5, i6.t4, i...497
Computing Next relation with stutter on 2.10753e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-22 10:06:31] [INFO ] Flatten gal took : 98 ms
[2024-05-22 10:06:31] [INFO ] Input system was already deterministic with 945 transitions.
[2024-05-22 10:06:31] [INFO ] Transformed 538 places.
[2024-05-22 10:06:31] [INFO ] Transformed 945 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 10:06:35] [INFO ] Time to serialize gal into /tmp/LTLFireability9021096741824652752.gal : 7 ms
[2024-05-22 10:06:35] [INFO ] Time to serialize properties into /tmp/LTLFireability490754402087363823.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9021096741824652752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability490754402087363823.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G("(p386==0)"))||(G(F((!("((p425==1)&&(p593==1))"))U((G(!("((p425==1)&&(p593==1))")))||((!("((p425==1)&&(p593==1))"))&&((X(!("...294
Formula 0 simplified : XX(F!"(p386==0)" & FG((X"((p408==1)&&(p477==1))" R (XF"((p408==1)&&(p477==1))" & ("((p16==1)&&(p87==1))" | X"((p408==1)&&(p477==1))"...187
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10898564 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038124 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ASLink-PT-02a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ASLink-PT-02a, 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 r021-smll-171620127700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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