Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700148.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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-09b-LTLFireability-00
FORMULA_NAME ASLink-PT-09b-LTLFireability-01
FORMULA_NAME ASLink-PT-09b-LTLFireability-02
FORMULA_NAME ASLink-PT-09b-LTLFireability-03
FORMULA_NAME ASLink-PT-09b-LTLFireability-04
FORMULA_NAME ASLink-PT-09b-LTLFireability-05
FORMULA_NAME ASLink-PT-09b-LTLFireability-06
FORMULA_NAME ASLink-PT-09b-LTLFireability-07
FORMULA_NAME ASLink-PT-09b-LTLFireability-08
FORMULA_NAME ASLink-PT-09b-LTLFireability-09
FORMULA_NAME ASLink-PT-09b-LTLFireability-10
FORMULA_NAME ASLink-PT-09b-LTLFireability-11
FORMULA_NAME ASLink-PT-09b-LTLFireability-12
FORMULA_NAME ASLink-PT-09b-LTLFireability-13
FORMULA_NAME ASLink-PT-09b-LTLFireability-14
FORMULA_NAME ASLink-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678504012647

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 03:06:56] [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]
[2023-03-11 03:06:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:06:56] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-11 03:06:56] [INFO ] Transformed 4014 places.
[2023-03-11 03:06:56] [INFO ] Transformed 4932 transitions.
[2023-03-11 03:06:56] [INFO ] Found NUPN structural information;
[2023-03-11 03:06:56] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-09b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 4014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Discarding 247 places :
Symmetric choice reduction at 0 with 247 rule applications. Total rules 247 place count 3767 transition count 4685
Iterating global reduction 0 with 247 rules applied. Total rules applied 494 place count 3767 transition count 4685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 495 place count 3767 transition count 4684
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 591 place count 3671 transition count 4535
Iterating global reduction 1 with 96 rules applied. Total rules applied 687 place count 3671 transition count 4535
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 716 place count 3671 transition count 4506
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 729 place count 3658 transition count 4493
Iterating global reduction 2 with 13 rules applied. Total rules applied 742 place count 3658 transition count 4493
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 746 place count 3654 transition count 4482
Iterating global reduction 2 with 4 rules applied. Total rules applied 750 place count 3654 transition count 4482
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 753 place count 3651 transition count 4479
Iterating global reduction 2 with 3 rules applied. Total rules applied 756 place count 3651 transition count 4479
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 759 place count 3648 transition count 4469
Iterating global reduction 2 with 3 rules applied. Total rules applied 762 place count 3648 transition count 4469
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 763 place count 3647 transition count 4461
Iterating global reduction 2 with 1 rules applied. Total rules applied 764 place count 3647 transition count 4461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 765 place count 3646 transition count 4460
Iterating global reduction 2 with 1 rules applied. Total rules applied 766 place count 3646 transition count 4460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 767 place count 3645 transition count 4452
Iterating global reduction 2 with 1 rules applied. Total rules applied 768 place count 3645 transition count 4452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 769 place count 3644 transition count 4444
Iterating global reduction 2 with 1 rules applied. Total rules applied 770 place count 3644 transition count 4444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 771 place count 3643 transition count 4443
Iterating global reduction 2 with 1 rules applied. Total rules applied 772 place count 3643 transition count 4443
Applied a total of 772 rules in 4559 ms. Remains 3643 /4014 variables (removed 371) and now considering 4443/4932 (removed 489) transitions.
// Phase 1: matrix 4443 rows 3643 cols
[2023-03-11 03:07:01] [INFO ] Computed 394 place invariants in 262 ms
[2023-03-11 03:07:06] [INFO ] Implicit Places using invariants in 4891 ms returned []
[2023-03-11 03:07:06] [INFO ] Invariant cache hit.
[2023-03-11 03:07:11] [INFO ] Implicit Places using invariants and state equation in 4822 ms returned [3477, 3488, 3499, 3507, 3515, 3523, 3531, 3542, 3550, 3558, 3569]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 9775 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3632/4014 places, 4443/4932 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3619 transition count 4430
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3619 transition count 4430
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3608 transition count 4419
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3608 transition count 4419
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3599 transition count 4410
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3599 transition count 4410
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3595 transition count 4406
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3595 transition count 4406
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3593 transition count 4404
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3593 transition count 4404
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3591 transition count 4402
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3591 transition count 4402
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3589 transition count 4400
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3589 transition count 4400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3587 transition count 4398
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3587 transition count 4398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3586 transition count 4397
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3586 transition count 4397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3585 transition count 4396
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3585 transition count 4396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3584 transition count 4395
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3584 transition count 4395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3583 transition count 4394
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3583 transition count 4394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3582 transition count 4393
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3582 transition count 4393
Applied a total of 100 rules in 3622 ms. Remains 3582 /3632 variables (removed 50) and now considering 4393/4443 (removed 50) transitions.
// Phase 1: matrix 4393 rows 3582 cols
[2023-03-11 03:07:15] [INFO ] Computed 383 place invariants in 120 ms
[2023-03-11 03:07:17] [INFO ] Implicit Places using invariants in 2464 ms returned []
[2023-03-11 03:07:17] [INFO ] Invariant cache hit.
[2023-03-11 03:07:23] [INFO ] Implicit Places using invariants and state equation in 5786 ms returned []
Implicit Place search using SMT with State Equation took 8275 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3582/4014 places, 4393/4932 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26233 ms. Remains : 3582/4014 places, 4393/4932 transitions.
Support contains 41 out of 3582 places after structural reductions.
[2023-03-11 03:07:23] [INFO ] Flatten gal took : 349 ms
[2023-03-11 03:07:24] [INFO ] Flatten gal took : 202 ms
[2023-03-11 03:07:24] [INFO ] Input system was already deterministic with 4393 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-11 03:07:25] [INFO ] Invariant cache hit.
[2023-03-11 03:07:27] [INFO ] [Real]Absence check using 92 positive place invariants in 64 ms returned sat
[2023-03-11 03:07:27] [INFO ] [Real]Absence check using 92 positive and 291 generalized place invariants in 482 ms returned sat
[2023-03-11 03:07:33] [INFO ] After 4343ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-11 03:07:35] [INFO ] Deduced a trap composed of 24 places in 2028 ms of which 26 ms to minimize.
[2023-03-11 03:07:38] [INFO ] Deduced a trap composed of 27 places in 3068 ms of which 4 ms to minimize.
[2023-03-11 03:07:41] [INFO ] Deduced a trap composed of 39 places in 2213 ms of which 20 ms to minimize.
[2023-03-11 03:07:43] [INFO ] Deduced a trap composed of 30 places in 2059 ms of which 4 ms to minimize.
[2023-03-11 03:07:45] [INFO ] Deduced a trap composed of 57 places in 1548 ms of which 1 ms to minimize.
[2023-03-11 03:07:46] [INFO ] Deduced a trap composed of 40 places in 1210 ms of which 2 ms to minimize.
[2023-03-11 03:07:47] [INFO ] Deduced a trap composed of 82 places in 879 ms of which 1 ms to minimize.
[2023-03-11 03:07:48] [INFO ] Deduced a trap composed of 101 places in 1004 ms of which 1 ms to minimize.
[2023-03-11 03:07:49] [INFO ] Deduced a trap composed of 90 places in 883 ms of which 1 ms to minimize.
[2023-03-11 03:07:50] [INFO ] Deduced a trap composed of 93 places in 719 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:07:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:07:50] [INFO ] After 25281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 277 ms.
Support contains 31 out of 3582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Drop transitions removed 654 transitions
Trivial Post-agglo rules discarded 654 transitions
Performed 654 trivial Post agglomeration. Transition count delta: 654
Iterating post reduction 0 with 654 rules applied. Total rules applied 654 place count 3582 transition count 3739
Reduce places removed 654 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 659 rules applied. Total rules applied 1313 place count 2928 transition count 3734
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 1319 place count 2925 transition count 3731
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1322 place count 2922 transition count 3731
Performed 961 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 961 Pre rules applied. Total rules applied 1322 place count 2922 transition count 2770
Deduced a syphon composed of 961 places in 9 ms
Ensure Unique test removed 92 places
Reduce places removed 1053 places and 0 transitions.
Iterating global reduction 4 with 2014 rules applied. Total rules applied 3336 place count 1869 transition count 2770
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 66 rules applied. Total rules applied 3402 place count 1860 transition count 2713
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 3459 place count 1803 transition count 2713
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 36 Pre rules applied. Total rules applied 3459 place count 1803 transition count 2677
Deduced a syphon composed of 36 places in 17 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 3567 place count 1731 transition count 2677
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 34 Pre rules applied. Total rules applied 3567 place count 1731 transition count 2643
Deduced a syphon composed of 34 places in 20 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 3635 place count 1697 transition count 2643
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 14 ms
Ensure Unique test removed 2 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 6 with 566 rules applied. Total rules applied 4201 place count 1413 transition count 2361
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4205 place count 1409 transition count 2357
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4210 place count 1408 transition count 2357
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4211 place count 1408 transition count 2356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4212 place count 1407 transition count 2356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4212 place count 1407 transition count 2355
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4214 place count 1406 transition count 2355
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4216 place count 1404 transition count 2353
Iterating global reduction 8 with 2 rules applied. Total rules applied 4218 place count 1404 transition count 2353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 4220 place count 1404 transition count 2351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4221 place count 1403 transition count 2351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4223 place count 1402 transition count 2356
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 4234 place count 1402 transition count 2345
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 4245 place count 1391 transition count 2345
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 4253 place count 1391 transition count 2337
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 4261 place count 1383 transition count 2337
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 4270 place count 1383 transition count 2337
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4271 place count 1382 transition count 2336
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 12 with 27 rules applied. Total rules applied 4298 place count 1364 transition count 2327
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4307 place count 1355 transition count 2327
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 27 Pre rules applied. Total rules applied 4307 place count 1355 transition count 2300
Deduced a syphon composed of 27 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 55 rules applied. Total rules applied 4362 place count 1327 transition count 2300
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 4371 place count 1318 transition count 2300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4371 place count 1318 transition count 2299
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4373 place count 1317 transition count 2299
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 15 with 36 rules applied. Total rules applied 4409 place count 1299 transition count 2281
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 4416 place count 1292 transition count 2274
Iterating global reduction 15 with 7 rules applied. Total rules applied 4423 place count 1292 transition count 2274
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4431 place count 1292 transition count 2266
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4439 place count 1284 transition count 2266
Applied a total of 4439 rules in 1344 ms. Remains 1284 /3582 variables (removed 2298) and now considering 2266/4393 (removed 2127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1344 ms. Remains : 1284/3582 places, 2266/4393 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 2266 rows 1284 cols
[2023-03-11 03:07:52] [INFO ] Computed 215 place invariants in 21 ms
[2023-03-11 03:07:53] [INFO ] [Real]Absence check using 58 positive place invariants in 363 ms returned sat
[2023-03-11 03:07:54] [INFO ] [Real]Absence check using 58 positive and 157 generalized place invariants in 184 ms returned sat
[2023-03-11 03:07:57] [INFO ] After 4168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-11 03:07:58] [INFO ] [Nat]Absence check using 58 positive place invariants in 234 ms returned sat
[2023-03-11 03:07:58] [INFO ] [Nat]Absence check using 58 positive and 157 generalized place invariants in 72 ms returned sat
[2023-03-11 03:08:14] [INFO ] After 15972ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :11
[2023-03-11 03:08:17] [INFO ] Deduced a trap composed of 75 places in 348 ms of which 33 ms to minimize.
[2023-03-11 03:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2023-03-11 03:08:17] [INFO ] After 18501ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :11
Attempting to minimize the solution found.
Minimization took 1337 ms.
[2023-03-11 03:08:18] [INFO ] After 21608ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :11
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 461 ms.
Support contains 16 out of 1284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1284/1284 places, 2266/2266 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1284 transition count 2263
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1281 transition count 2263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1280 transition count 2255
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1280 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1279 transition count 2247
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1279 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1278 transition count 2239
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1278 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1277 transition count 2231
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1277 transition count 2231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1276 transition count 2223
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1276 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1275 transition count 2215
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1275 transition count 2215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1274 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1274 transition count 2207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1273 transition count 2199
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1273 transition count 2199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1272 transition count 2191
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1272 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1271 transition count 2183
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1271 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1270 transition count 2175
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1270 transition count 2175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1268 transition count 2173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 1267 transition count 2172
Applied a total of 33 rules in 522 ms. Remains 1267 /1284 variables (removed 17) and now considering 2172/2266 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 1267/1284 places, 2172/2266 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 104158 steps, run timeout after 3010 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104158 steps, saw 24127 distinct states, run finished after 3014 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2172 rows 1267 cols
[2023-03-11 03:08:23] [INFO ] Computed 215 place invariants in 20 ms
[2023-03-11 03:08:24] [INFO ] [Real]Absence check using 58 positive place invariants in 64 ms returned sat
[2023-03-11 03:08:24] [INFO ] [Real]Absence check using 58 positive and 157 generalized place invariants in 42 ms returned sat
[2023-03-11 03:08:27] [INFO ] After 4049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 03:08:28] [INFO ] [Nat]Absence check using 58 positive place invariants in 219 ms returned sat
[2023-03-11 03:08:28] [INFO ] [Nat]Absence check using 58 positive and 157 generalized place invariants in 44 ms returned sat
[2023-03-11 03:08:40] [INFO ] After 11783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 03:08:42] [INFO ] After 13473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 805 ms.
[2023-03-11 03:08:43] [INFO ] After 15578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 415 ms.
Support contains 14 out of 1267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1267/1267 places, 2172/2172 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1267 transition count 2170
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1265 transition count 2170
Applied a total of 4 rules in 57 ms. Remains 1265 /1267 variables (removed 2) and now considering 2170/2172 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1265/1267 places, 2170/2172 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 120674 steps, run timeout after 3005 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120674 steps, saw 27834 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2170 rows 1265 cols
[2023-03-11 03:08:47] [INFO ] Computed 215 place invariants in 17 ms
[2023-03-11 03:08:48] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-11 03:08:48] [INFO ] [Real]Absence check using 58 positive and 157 generalized place invariants in 65 ms returned sat
[2023-03-11 03:08:51] [INFO ] After 3424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 03:08:51] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-11 03:08:51] [INFO ] [Nat]Absence check using 58 positive and 157 generalized place invariants in 146 ms returned sat
[2023-03-11 03:08:57] [INFO ] After 5361ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-11 03:08:59] [INFO ] After 6900ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 997 ms.
[2023-03-11 03:09:00] [INFO ] After 8922ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 559 ms.
Support contains 12 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 2170/2170 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1265 transition count 2168
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1263 transition count 2168
Applied a total of 4 rules in 56 ms. Remains 1263 /1265 variables (removed 2) and now considering 2168/2170 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1263/1265 places, 2168/2170 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 117611 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117611 steps, saw 27135 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2168 rows 1263 cols
[2023-03-11 03:09:05] [INFO ] Computed 215 place invariants in 30 ms
[2023-03-11 03:09:05] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-11 03:09:05] [INFO ] [Real]Absence check using 58 positive and 157 generalized place invariants in 66 ms returned sat
[2023-03-11 03:09:07] [INFO ] After 2765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 03:09:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-11 03:09:08] [INFO ] [Nat]Absence check using 58 positive and 157 generalized place invariants in 84 ms returned sat
[2023-03-11 03:09:10] [INFO ] After 2422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 03:09:12] [INFO ] Deduced a trap composed of 60 places in 527 ms of which 1 ms to minimize.
[2023-03-11 03:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 680 ms
[2023-03-11 03:09:13] [INFO ] After 4747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1071 ms.
[2023-03-11 03:09:14] [INFO ] After 6607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 224 ms.
Support contains 12 out of 1263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 2168/2168 transitions.
Applied a total of 0 rules in 50 ms. Remains 1263 /1263 variables (removed 0) and now considering 2168/2168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1263/1263 places, 2168/2168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 2168/2168 transitions.
Applied a total of 0 rules in 46 ms. Remains 1263 /1263 variables (removed 0) and now considering 2168/2168 (removed 0) transitions.
[2023-03-11 03:09:14] [INFO ] Invariant cache hit.
[2023-03-11 03:09:16] [INFO ] Implicit Places using invariants in 1512 ms returned [1, 18, 19, 32, 49, 67, 138, 142, 151, 152, 154, 171, 189, 260, 264, 265, 276, 277, 279, 296, 314, 365, 368, 389, 393, 394, 405, 406, 408, 425, 443, 512, 516, 517, 528, 529, 531, 549, 567, 636, 640, 641, 652, 653, 655, 672, 690, 761, 768, 772, 773, 784, 787, 789, 806, 824, 894, 898, 899, 910, 911, 913, 930, 948, 1019, 1023, 1024, 1035, 1036, 1038, 1055, 1073, 1142, 1146, 1147, 1150, 1161, 1162, 1163, 1181, 1202, 1203, 1204, 1205]
Discarding 84 places :
Implicit Place search using SMT only with invariants took 1515 ms to find 84 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1179/1263 places, 2168/2168 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 1179 transition count 2016
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 165 rules applied. Total rules applied 317 place count 1027 transition count 2003
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 323 place count 1021 transition count 2003
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 323 place count 1021 transition count 1960
Deduced a syphon composed of 43 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 410 place count 977 transition count 1960
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 422 place count 973 transition count 1952
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 430 place count 965 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 434 place count 961 transition count 1948
Iterating global reduction 5 with 4 rules applied. Total rules applied 438 place count 961 transition count 1948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 441 place count 961 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 960 transition count 1944
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 960 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 444 place count 960 transition count 1943
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 562 place count 901 transition count 1884
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 569 place count 894 transition count 1877
Iterating global reduction 7 with 7 rules applied. Total rules applied 576 place count 894 transition count 1877
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 583 place count 894 transition count 1870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 587 place count 892 transition count 1871
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 588 place count 892 transition count 1870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 589 place count 891 transition count 1870
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 612 place count 891 transition count 1847
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 636 place count 867 transition count 1847
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 637 place count 867 transition count 1846
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 10 with 27 rules applied. Total rules applied 664 place count 867 transition count 1846
Applied a total of 664 rules in 633 ms. Remains 867 /1179 variables (removed 312) and now considering 1846/2168 (removed 322) transitions.
// Phase 1: matrix 1846 rows 867 cols
[2023-03-11 03:09:16] [INFO ] Computed 125 place invariants in 22 ms
[2023-03-11 03:09:18] [INFO ] Implicit Places using invariants in 1620 ms returned [91, 97, 100, 102, 106, 107, 160, 177, 183, 186, 188, 193, 194, 247, 272, 275, 277, 282, 283, 336, 352, 358, 361, 363, 368, 369, 423, 439, 445, 448, 450, 455, 456, 510, 527, 533, 536, 538, 545, 546, 601, 619, 625, 628, 630, 635, 636, 689, 706, 712, 715, 717, 722, 723, 776, 792, 798, 801, 803]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 1624 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 808/1263 places, 1846/2168 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 783 transition count 1821
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 783 transition count 1821
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 775 transition count 1813
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 775 transition count 1813
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 98 place count 759 transition count 1797
Free-agglomeration rule applied 26 times.
Iterating global reduction 0 with 26 rules applied. Total rules applied 124 place count 759 transition count 1771
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 150 place count 733 transition count 1771
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 158 place count 733 transition count 1763
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 166 place count 725 transition count 1763
Applied a total of 166 rules in 222 ms. Remains 725 /808 variables (removed 83) and now considering 1763/1846 (removed 83) transitions.
// Phase 1: matrix 1763 rows 725 cols
[2023-03-11 03:09:18] [INFO ] Computed 66 place invariants in 34 ms
[2023-03-11 03:09:19] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-11 03:09:19] [INFO ] Invariant cache hit.
[2023-03-11 03:09:21] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 725/1263 places, 1763/2168 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6946 ms. Remains : 725/1263 places, 1763/2168 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-09b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 146 stabilizing places and 146 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p0)))))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5338 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
// Phase 1: matrix 4294 rows 3561 cols
[2023-03-11 03:09:27] [INFO ] Computed 383 place invariants in 98 ms
[2023-03-11 03:09:31] [INFO ] Implicit Places using invariants in 3775 ms returned []
[2023-03-11 03:09:31] [INFO ] Invariant cache hit.
[2023-03-11 03:09:34] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 7552 ms to find 0 implicit places.
[2023-03-11 03:09:34] [INFO ] Invariant cache hit.
[2023-03-11 03:09:40] [INFO ] Dead Transitions using invariants and state equation in 5133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18025 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 518 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2030 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-00 finished in 18684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X((p1||G(p2)))||G(p0))))))'
Support contains 2 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5577 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
[2023-03-11 03:09:46] [INFO ] Invariant cache hit.
[2023-03-11 03:09:48] [INFO ] Implicit Places using invariants in 2342 ms returned []
[2023-03-11 03:09:48] [INFO ] Invariant cache hit.
[2023-03-11 03:09:52] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 6324 ms to find 0 implicit places.
[2023-03-11 03:09:52] [INFO ] Invariant cache hit.
[2023-03-11 03:09:57] [INFO ] Dead Transitions using invariants and state equation in 4724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16641 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 765 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s2738 1), p1:(EQ s2851 1), p2:(EQ s2738 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 130 reset in 680 ms.
Product exploration explored 100000 steps with 130 reset in 665 ms.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 438 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132701 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132701 steps, saw 29248 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:10:03] [INFO ] Invariant cache hit.
[2023-03-11 03:10:04] [INFO ] After 775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:10:04] [INFO ] [Nat]Absence check using 94 positive place invariants in 58 ms returned sat
[2023-03-11 03:10:05] [INFO ] [Nat]Absence check using 94 positive and 289 generalized place invariants in 252 ms returned sat
[2023-03-11 03:10:09] [INFO ] After 4531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:12] [INFO ] Deduced a trap composed of 93 places in 2686 ms of which 3 ms to minimize.
[2023-03-11 03:10:15] [INFO ] Deduced a trap composed of 31 places in 2303 ms of which 4 ms to minimize.
[2023-03-11 03:10:17] [INFO ] Deduced a trap composed of 24 places in 1992 ms of which 3 ms to minimize.
[2023-03-11 03:10:19] [INFO ] Deduced a trap composed of 26 places in 2344 ms of which 3 ms to minimize.
[2023-03-11 03:10:22] [INFO ] Deduced a trap composed of 35 places in 1919 ms of which 3 ms to minimize.
[2023-03-11 03:10:23] [INFO ] Deduced a trap composed of 33 places in 1679 ms of which 3 ms to minimize.
[2023-03-11 03:10:26] [INFO ] Deduced a trap composed of 27 places in 2514 ms of which 4 ms to minimize.
[2023-03-11 03:10:28] [INFO ] Deduced a trap composed of 44 places in 2079 ms of which 3 ms to minimize.
[2023-03-11 03:10:30] [INFO ] Deduced a trap composed of 31 places in 1930 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:10:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:10:30] [INFO ] After 26738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 176 ms.
Support contains 1 out of 3561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3561/3561 places, 4294/4294 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 664 place count 3561 transition count 3630
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 667 rules applied. Total rules applied 1331 place count 2897 transition count 3627
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1333 place count 2895 transition count 3627
Performed 966 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 966 Pre rules applied. Total rules applied 1333 place count 2895 transition count 2661
Deduced a syphon composed of 966 places in 7 ms
Ensure Unique test removed 94 places
Reduce places removed 1060 places and 0 transitions.
Iterating global reduction 3 with 2026 rules applied. Total rules applied 3359 place count 1835 transition count 2661
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3426 place count 1826 transition count 2603
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3484 place count 1768 transition count 2603
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3484 place count 1768 transition count 2566
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3595 place count 1694 transition count 2566
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3595 place count 1694 transition count 2530
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3667 place count 1658 transition count 2530
Performed 284 Post agglomeration using F-continuation condition.Transition count delta: 284
Deduced a syphon composed of 284 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 5 with 570 rules applied. Total rules applied 4237 place count 1372 transition count 2246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4241 place count 1368 transition count 2242
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4246 place count 1367 transition count 2242
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 4247 place count 1367 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4248 place count 1366 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4248 place count 1366 transition count 2240
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4250 place count 1365 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4252 place count 1363 transition count 2238
Iterating global reduction 7 with 2 rules applied. Total rules applied 4254 place count 1363 transition count 2238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4256 place count 1363 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4257 place count 1362 transition count 2236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4259 place count 1361 transition count 2241
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 4269 place count 1361 transition count 2231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 4279 place count 1351 transition count 2231
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4287 place count 1351 transition count 2223
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4295 place count 1343 transition count 2223
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 4304 place count 1343 transition count 2223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4305 place count 1342 transition count 2222
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 27 rules applied. Total rules applied 4332 place count 1324 transition count 2213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4341 place count 1315 transition count 2213
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 27 Pre rules applied. Total rules applied 4341 place count 1315 transition count 2186
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 55 rules applied. Total rules applied 4396 place count 1287 transition count 2186
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 13 with 10 rules applied. Total rules applied 4406 place count 1277 transition count 2186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4406 place count 1277 transition count 2185
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4408 place count 1276 transition count 2185
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 38 rules applied. Total rules applied 4446 place count 1257 transition count 2166
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 4455 place count 1248 transition count 2157
Iterating global reduction 14 with 9 rules applied. Total rules applied 4464 place count 1248 transition count 2157
Free-agglomeration rule applied 9 times.
Iterating global reduction 14 with 9 rules applied. Total rules applied 4473 place count 1248 transition count 2148
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 4482 place count 1239 transition count 2148
Applied a total of 4482 rules in 1423 ms. Remains 1239 /3561 variables (removed 2322) and now considering 2148/4294 (removed 2146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1423 ms. Remains : 1239/3561 places, 2148/4294 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 220039 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220039 steps, saw 48446 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2148 rows 1239 cols
[2023-03-11 03:10:35] [INFO ] Computed 211 place invariants in 56 ms
[2023-03-11 03:10:35] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:10:36] [INFO ] [Nat]Absence check using 61 positive place invariants in 13 ms returned sat
[2023-03-11 03:10:36] [INFO ] [Nat]Absence check using 61 positive and 150 generalized place invariants in 52 ms returned sat
[2023-03-11 03:10:37] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:37] [INFO ] After 1095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-11 03:10:37] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 1239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1239/1239 places, 2148/2148 transitions.
Applied a total of 0 rules in 51 ms. Remains 1239 /1239 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1239/1239 places, 2148/2148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1239/1239 places, 2148/2148 transitions.
Applied a total of 0 rules in 51 ms. Remains 1239 /1239 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
[2023-03-11 03:10:37] [INFO ] Invariant cache hit.
[2023-03-11 03:10:38] [INFO ] Implicit Places using invariants in 1137 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 660, 678, 747, 751, 752, 763, 764, 766, 783, 801, 870, 874, 875, 886, 887, 889, 906, 924, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1126, 1137, 1138, 1139, 1157, 1178, 1179, 1180, 1181]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1154 ms to find 81 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1158/1239 places, 2148/2148 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 1158 transition count 1992
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 322 place count 1002 transition count 1982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 1001 transition count 1982
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 323 place count 1001 transition count 1939
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 410 place count 957 transition count 1939
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 422 place count 953 transition count 1931
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 430 place count 945 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 433 place count 942 transition count 1928
Iterating global reduction 5 with 3 rules applied. Total rules applied 436 place count 942 transition count 1928
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 439 place count 942 transition count 1925
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 559 place count 882 transition count 1865
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 568 place count 873 transition count 1856
Iterating global reduction 6 with 9 rules applied. Total rules applied 577 place count 873 transition count 1856
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 586 place count 873 transition count 1847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 590 place count 871 transition count 1848
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 609 place count 871 transition count 1829
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 629 place count 851 transition count 1829
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 656 place count 851 transition count 1829
Applied a total of 656 rules in 255 ms. Remains 851 /1158 variables (removed 307) and now considering 1829/2148 (removed 319) transitions.
// Phase 1: matrix 1829 rows 851 cols
[2023-03-11 03:10:38] [INFO ] Computed 124 place invariants in 45 ms
[2023-03-11 03:10:39] [INFO ] Implicit Places using invariants in 1079 ms returned [73, 89, 95, 98, 100, 103, 104, 157, 173, 179, 182, 184, 189, 190, 243, 259, 265, 268, 270, 275, 276, 329, 345, 351, 354, 356, 361, 362, 415, 431, 437, 440, 442, 447, 448, 501, 517, 523, 526, 528, 533, 534, 587, 603, 609, 612, 614, 619, 620, 673, 690, 696, 699, 701, 706, 707, 760, 776, 782, 785, 787]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 790/1239 places, 1829/2148 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 763 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 763 transition count 1802
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 754 transition count 1793
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 754 transition count 1793
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 108 place count 736 transition count 1775
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 135 place count 736 transition count 1748
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 162 place count 709 transition count 1748
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 171 place count 709 transition count 1739
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 180 place count 700 transition count 1739
Applied a total of 180 rules in 180 ms. Remains 700 /790 variables (removed 90) and now considering 1739/1829 (removed 90) transitions.
// Phase 1: matrix 1739 rows 700 cols
[2023-03-11 03:10:40] [INFO ] Computed 63 place invariants in 32 ms
[2023-03-11 03:10:41] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-11 03:10:41] [INFO ] Invariant cache hit.
[2023-03-11 03:10:42] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 700/1239 places, 1739/2148 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5298 ms. Remains : 700/1239 places, 1739/2148 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280113 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280113 steps, saw 83075 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:10:45] [INFO ] Invariant cache hit.
[2023-03-11 03:10:45] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:10:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 03:10:46] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 33 ms returned sat
[2023-03-11 03:10:46] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:46] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-11 03:10:47] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 51 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 700/700 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 31 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:10:47] [INFO ] Invariant cache hit.
[2023-03-11 03:10:47] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-11 03:10:47] [INFO ] Invariant cache hit.
[2023-03-11 03:10:49] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2825 ms to find 0 implicit places.
[2023-03-11 03:10:50] [INFO ] Redundant transitions in 182 ms returned []
[2023-03-11 03:10:50] [INFO ] Invariant cache hit.
[2023-03-11 03:10:51] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4064 ms. Remains : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 37 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 03:10:51] [INFO ] Invariant cache hit.
[2023-03-11 03:10:51] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:10:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 03:10:51] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 63 ms returned sat
[2023-03-11 03:10:52] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:10:52] [INFO ] After 1176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 03:10:52] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 443 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 3561 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3561/3561 places, 4294/4294 transitions.
Applied a total of 0 rules in 325 ms. Remains 3561 /3561 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
// Phase 1: matrix 4294 rows 3561 cols
[2023-03-11 03:10:54] [INFO ] Computed 383 place invariants in 84 ms
[2023-03-11 03:10:56] [INFO ] Implicit Places using invariants in 2301 ms returned []
[2023-03-11 03:10:56] [INFO ] Invariant cache hit.
[2023-03-11 03:11:19] [INFO ] Implicit Places using invariants and state equation in 22987 ms returned []
Implicit Place search using SMT with State Equation took 25297 ms to find 0 implicit places.
[2023-03-11 03:11:19] [INFO ] Invariant cache hit.
[2023-03-11 03:11:23] [INFO ] Dead Transitions using invariants and state equation in 4047 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29683 ms. Remains : 3561/3561 places, 4294/4294 transitions.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 139500 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139500 steps, saw 30261 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:11:27] [INFO ] Invariant cache hit.
[2023-03-11 03:11:27] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:11:28] [INFO ] [Nat]Absence check using 94 positive place invariants in 65 ms returned sat
[2023-03-11 03:11:28] [INFO ] [Nat]Absence check using 94 positive and 289 generalized place invariants in 533 ms returned sat
[2023-03-11 03:11:34] [INFO ] After 6079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:11:37] [INFO ] Deduced a trap composed of 93 places in 2168 ms of which 3 ms to minimize.
[2023-03-11 03:11:39] [INFO ] Deduced a trap composed of 31 places in 2148 ms of which 3 ms to minimize.
[2023-03-11 03:11:42] [INFO ] Deduced a trap composed of 24 places in 2454 ms of which 3 ms to minimize.
[2023-03-11 03:11:44] [INFO ] Deduced a trap composed of 26 places in 2038 ms of which 2 ms to minimize.
[2023-03-11 03:11:47] [INFO ] Deduced a trap composed of 35 places in 2213 ms of which 3 ms to minimize.
[2023-03-11 03:11:49] [INFO ] Deduced a trap composed of 33 places in 1930 ms of which 39 ms to minimize.
[2023-03-11 03:11:51] [INFO ] Deduced a trap composed of 27 places in 2203 ms of which 3 ms to minimize.
[2023-03-11 03:11:53] [INFO ] Deduced a trap composed of 44 places in 2124 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:11:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:11:53] [INFO ] After 26305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 185 ms.
Support contains 1 out of 3561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3561/3561 places, 4294/4294 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 664 place count 3561 transition count 3630
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 667 rules applied. Total rules applied 1331 place count 2897 transition count 3627
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1333 place count 2895 transition count 3627
Performed 966 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 966 Pre rules applied. Total rules applied 1333 place count 2895 transition count 2661
Deduced a syphon composed of 966 places in 7 ms
Ensure Unique test removed 94 places
Reduce places removed 1060 places and 0 transitions.
Iterating global reduction 3 with 2026 rules applied. Total rules applied 3359 place count 1835 transition count 2661
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3426 place count 1826 transition count 2603
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3484 place count 1768 transition count 2603
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3484 place count 1768 transition count 2566
Deduced a syphon composed of 37 places in 8 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3595 place count 1694 transition count 2566
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3595 place count 1694 transition count 2530
Deduced a syphon composed of 36 places in 8 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3667 place count 1658 transition count 2530
Performed 284 Post agglomeration using F-continuation condition.Transition count delta: 284
Deduced a syphon composed of 284 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 5 with 570 rules applied. Total rules applied 4237 place count 1372 transition count 2246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4241 place count 1368 transition count 2242
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4246 place count 1367 transition count 2242
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 4247 place count 1367 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4248 place count 1366 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4248 place count 1366 transition count 2240
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4250 place count 1365 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4252 place count 1363 transition count 2238
Iterating global reduction 7 with 2 rules applied. Total rules applied 4254 place count 1363 transition count 2238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4256 place count 1363 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4257 place count 1362 transition count 2236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4259 place count 1361 transition count 2241
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 4269 place count 1361 transition count 2231
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 4279 place count 1351 transition count 2231
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4287 place count 1351 transition count 2223
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4295 place count 1343 transition count 2223
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 4304 place count 1343 transition count 2223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4305 place count 1342 transition count 2222
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 11 with 27 rules applied. Total rules applied 4332 place count 1324 transition count 2213
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4341 place count 1315 transition count 2213
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 27 Pre rules applied. Total rules applied 4341 place count 1315 transition count 2186
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 55 rules applied. Total rules applied 4396 place count 1287 transition count 2186
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 13 with 10 rules applied. Total rules applied 4406 place count 1277 transition count 2186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4406 place count 1277 transition count 2185
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4408 place count 1276 transition count 2185
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 38 rules applied. Total rules applied 4446 place count 1257 transition count 2166
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 4455 place count 1248 transition count 2157
Iterating global reduction 14 with 9 rules applied. Total rules applied 4464 place count 1248 transition count 2157
Free-agglomeration rule applied 9 times.
Iterating global reduction 14 with 9 rules applied. Total rules applied 4473 place count 1248 transition count 2148
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 4482 place count 1239 transition count 2148
Applied a total of 4482 rules in 1109 ms. Remains 1239 /3561 variables (removed 2322) and now considering 2148/4294 (removed 2146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 1239/3561 places, 2148/4294 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216590 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216590 steps, saw 47900 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2148 rows 1239 cols
[2023-03-11 03:11:58] [INFO ] Computed 211 place invariants in 51 ms
[2023-03-11 03:11:58] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:11:58] [INFO ] [Nat]Absence check using 61 positive place invariants in 16 ms returned sat
[2023-03-11 03:11:58] [INFO ] [Nat]Absence check using 61 positive and 150 generalized place invariants in 94 ms returned sat
[2023-03-11 03:12:00] [INFO ] After 1123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:12:00] [INFO ] After 1265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-11 03:12:00] [INFO ] After 1688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 1239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1239/1239 places, 2148/2148 transitions.
Applied a total of 0 rules in 60 ms. Remains 1239 /1239 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1239/1239 places, 2148/2148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1239/1239 places, 2148/2148 transitions.
Applied a total of 0 rules in 44 ms. Remains 1239 /1239 variables (removed 0) and now considering 2148/2148 (removed 0) transitions.
[2023-03-11 03:12:00] [INFO ] Invariant cache hit.
[2023-03-11 03:12:01] [INFO ] Implicit Places using invariants in 1136 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 660, 678, 747, 751, 752, 763, 764, 766, 783, 801, 870, 874, 875, 886, 887, 889, 906, 924, 995, 999, 1000, 1011, 1012, 1014, 1031, 1049, 1118, 1122, 1123, 1126, 1137, 1138, 1139, 1157, 1178, 1179, 1180, 1181]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1139 ms to find 81 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1158/1239 places, 2148/2148 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 1158 transition count 1992
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 322 place count 1002 transition count 1982
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 1001 transition count 1982
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 323 place count 1001 transition count 1939
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 410 place count 957 transition count 1939
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 422 place count 953 transition count 1931
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 430 place count 945 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 433 place count 942 transition count 1928
Iterating global reduction 5 with 3 rules applied. Total rules applied 436 place count 942 transition count 1928
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 439 place count 942 transition count 1925
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 559 place count 882 transition count 1865
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 568 place count 873 transition count 1856
Iterating global reduction 6 with 9 rules applied. Total rules applied 577 place count 873 transition count 1856
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 586 place count 873 transition count 1847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 590 place count 871 transition count 1848
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 609 place count 871 transition count 1829
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 629 place count 851 transition count 1829
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 656 place count 851 transition count 1829
Applied a total of 656 rules in 248 ms. Remains 851 /1158 variables (removed 307) and now considering 1829/2148 (removed 319) transitions.
// Phase 1: matrix 1829 rows 851 cols
[2023-03-11 03:12:01] [INFO ] Computed 124 place invariants in 17 ms
[2023-03-11 03:12:02] [INFO ] Implicit Places using invariants in 1113 ms returned [73, 89, 95, 98, 100, 103, 104, 157, 173, 179, 182, 184, 189, 190, 243, 259, 265, 268, 270, 275, 276, 329, 345, 351, 354, 356, 361, 362, 415, 431, 437, 440, 442, 447, 448, 501, 517, 523, 526, 528, 533, 534, 587, 603, 609, 612, 614, 619, 620, 673, 690, 696, 699, 701, 706, 707, 760, 776, 782, 785, 787]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 1115 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 790/1239 places, 1829/2148 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 763 transition count 1802
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 763 transition count 1802
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 754 transition count 1793
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 754 transition count 1793
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 108 place count 736 transition count 1775
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 135 place count 736 transition count 1748
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 162 place count 709 transition count 1748
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 171 place count 709 transition count 1739
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 180 place count 700 transition count 1739
Applied a total of 180 rules in 166 ms. Remains 700 /790 variables (removed 90) and now considering 1739/1829 (removed 90) transitions.
// Phase 1: matrix 1739 rows 700 cols
[2023-03-11 03:12:03] [INFO ] Computed 63 place invariants in 44 ms
[2023-03-11 03:12:03] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-11 03:12:03] [INFO ] Invariant cache hit.
[2023-03-11 03:12:07] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 4158 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 700/1239 places, 1739/2148 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6871 ms. Remains : 700/1239 places, 1739/2148 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 281380 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281380 steps, saw 83556 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:12:10] [INFO ] Invariant cache hit.
[2023-03-11 03:12:10] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:12:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-11 03:12:10] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 52 ms returned sat
[2023-03-11 03:12:11] [INFO ] After 971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:12:11] [INFO ] After 1060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-11 03:12:11] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 43 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 700/700 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 29 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:12:11] [INFO ] Invariant cache hit.
[2023-03-11 03:12:12] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-11 03:12:12] [INFO ] Invariant cache hit.
[2023-03-11 03:12:17] [INFO ] Implicit Places using invariants and state equation in 5503 ms returned []
Implicit Place search using SMT with State Equation took 6046 ms to find 0 implicit places.
[2023-03-11 03:12:17] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-11 03:12:17] [INFO ] Invariant cache hit.
[2023-03-11 03:12:18] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7073 ms. Remains : 700/700 places, 1739/1739 transitions.
Applied a total of 0 rules in 29 ms. Remains 700 /700 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 03:12:18] [INFO ] Invariant cache hit.
[2023-03-11 03:12:19] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:12:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 105 ms returned sat
[2023-03-11 03:12:19] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 134 ms returned sat
[2023-03-11 03:12:20] [INFO ] After 1432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:12:21] [INFO ] After 1526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-11 03:12:21] [INFO ] After 1999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 129 reset in 498 ms.
Product exploration explored 100000 steps with 134 reset in 658 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 3561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3561/3561 places, 4294/4294 transitions.
Performed 646 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 646 rules applied. Total rules applied 646 place count 3561 transition count 4294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 647 place count 3561 transition count 4293
Performed 651 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 651 Pre rules applied. Total rules applied 647 place count 3561 transition count 4438
Deduced a syphon composed of 1297 places in 14 ms
Iterating global reduction 2 with 651 rules applied. Total rules applied 1298 place count 3561 transition count 4438
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 1661 place count 3198 transition count 4075
Deduced a syphon composed of 934 places in 11 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 2024 place count 3198 transition count 4075
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 2024 place count 3198 transition count 4084
Deduced a syphon composed of 943 places in 25 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 2033 place count 3198 transition count 4084
Performed 615 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1558 places in 12 ms
Iterating global reduction 2 with 615 rules applied. Total rules applied 2648 place count 3198 transition count 4085
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 2887 place count 2959 transition count 3844
Deduced a syphon composed of 1323 places in 10 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 3126 place count 2959 transition count 3844
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 3128 place count 2957 transition count 3841
Deduced a syphon composed of 1323 places in 10 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 3130 place count 2957 transition count 3841
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3132 place count 2957 transition count 3839
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -171
Deduced a syphon composed of 1374 places in 9 ms
Iterating global reduction 3 with 51 rules applied. Total rules applied 3183 place count 2957 transition count 4010
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 3196 place count 2944 transition count 3982
Deduced a syphon composed of 1361 places in 8 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 3209 place count 2944 transition count 3982
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1362 places in 9 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 3210 place count 2944 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3211 place count 2943 transition count 3982
Deduced a syphon composed of 1361 places in 8 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 3212 place count 2943 transition count 3982
Deduced a syphon composed of 1361 places in 7 ms
Applied a total of 3212 rules in 2278 ms. Remains 2943 /3561 variables (removed 618) and now considering 3982/4294 (removed 312) transitions.
[2023-03-11 03:12:26] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 3982 rows 2943 cols
[2023-03-11 03:12:26] [INFO ] Computed 383 place invariants in 51 ms
[2023-03-11 03:12:29] [INFO ] Dead Transitions using invariants and state equation in 3318 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2943/3561 places, 3982/4294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5847 ms. Remains : 2943/3561 places, 3982/4294 transitions.
Built C files in :
/tmp/ltsmin881337508009607039
[2023-03-11 03:12:29] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin881337508009607039
Running compilation step : cd /tmp/ltsmin881337508009607039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin881337508009607039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin881337508009607039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 3561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3561/3561 places, 4294/4294 transitions.
Applied a total of 0 rules in 357 ms. Remains 3561 /3561 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
// Phase 1: matrix 4294 rows 3561 cols
[2023-03-11 03:12:33] [INFO ] Computed 383 place invariants in 39 ms
[2023-03-11 03:12:35] [INFO ] Implicit Places using invariants in 2437 ms returned []
[2023-03-11 03:12:35] [INFO ] Invariant cache hit.
[2023-03-11 03:12:39] [INFO ] Implicit Places using invariants and state equation in 4000 ms returned []
Implicit Place search using SMT with State Equation took 6468 ms to find 0 implicit places.
[2023-03-11 03:12:39] [INFO ] Invariant cache hit.
[2023-03-11 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 6523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13366 ms. Remains : 3561/3561 places, 4294/4294 transitions.
Built C files in :
/tmp/ltsmin4600075653779960248
[2023-03-11 03:12:46] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4600075653779960248
Running compilation step : cd /tmp/ltsmin4600075653779960248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4600075653779960248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4600075653779960248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 03:12:50] [INFO ] Flatten gal took : 206 ms
[2023-03-11 03:12:50] [INFO ] Flatten gal took : 209 ms
[2023-03-11 03:12:50] [INFO ] Time to serialize gal into /tmp/LTL754550341000862546.gal : 32 ms
[2023-03-11 03:12:50] [INFO ] Time to serialize properties into /tmp/LTL6306774134446303205.prop : 7 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL754550341000862546.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10720496600723020560.hoa' '-atoms' '/tmp/LTL6306774134446303205.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6306774134446303205.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10720496600723020560.hoa
Detected timeout of ITS tools.
[2023-03-11 03:13:05] [INFO ] Flatten gal took : 123 ms
[2023-03-11 03:13:05] [INFO ] Flatten gal took : 133 ms
[2023-03-11 03:13:05] [INFO ] Time to serialize gal into /tmp/LTL17537911661544980064.gal : 22 ms
[2023-03-11 03:13:05] [INFO ] Time to serialize properties into /tmp/LTL17389094399605768316.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17537911661544980064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17389094399605768316.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(p3011==1)")||(G((X(("(p3127==1)")||(G("(p3011==0)"))))||(G("(p3011==1)")))))))
Formula 0 simplified : X(!"(p3011==1)" & F(X(!"(p3127==1)" & F!"(p3011==0)") & F!"(p3011==1)"))
Detected timeout of ITS tools.
[2023-03-11 03:13:21] [INFO ] Flatten gal took : 192 ms
[2023-03-11 03:13:21] [INFO ] Applying decomposition
[2023-03-11 03:13:21] [INFO ] Flatten gal took : 188 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15614890174387506134.txt' '-o' '/tmp/graph15614890174387506134.bin' '-w' '/tmp/graph15614890174387506134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15614890174387506134.bin' '-l' '-1' '-v' '-w' '/tmp/graph15614890174387506134.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:13:22] [INFO ] Decomposing Gal with order
[2023-03-11 03:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:13:22] [INFO ] Removed a total of 3145 redundant transitions.
[2023-03-11 03:13:23] [INFO ] Flatten gal took : 377 ms
[2023-03-11 03:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 68 ms.
[2023-03-11 03:13:23] [INFO ] Time to serialize gal into /tmp/LTL8633750492383714828.gal : 52 ms
[2023-03-11 03:13:23] [INFO ] Time to serialize properties into /tmp/LTL8265405387511792936.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8633750492383714828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8265405387511792936.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i30.u1047.p3011==1)")||(G((X(("(i32.u1096.p3127==1)")||(G("(i30.u1047.p3011==0)"))))||(G("(i30.u1047.p3011==1)")))))))
Formula 0 simplified : X(!"(i30.u1047.p3011==1)" & F(X(!"(i32.u1096.p3127==1)" & F!"(i30.u1047.p3011==0)") & F!"(i30.u1047.p3011==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15528781850123902049
[2023-03-11 03:13:38] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15528781850123902049
Running compilation step : cd /tmp/ltsmin15528781850123902049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15528781850123902049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15528781850123902049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09b-LTLFireability-01 finished in 240962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&(p1||G(p2))))))))'
Support contains 4 out of 3582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 664 place count 3581 transition count 3728
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 669 rules applied. Total rules applied 1333 place count 2917 transition count 3723
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1336 place count 2914 transition count 3723
Performed 969 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 969 Pre rules applied. Total rules applied 1336 place count 2914 transition count 2754
Deduced a syphon composed of 969 places in 8 ms
Ensure Unique test removed 93 places
Reduce places removed 1062 places and 0 transitions.
Iterating global reduction 3 with 2031 rules applied. Total rules applied 3367 place count 1852 transition count 2754
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 3 with 66 rules applied. Total rules applied 3433 place count 1843 transition count 2697
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 3490 place count 1786 transition count 2697
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3490 place count 1786 transition count 2660
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3601 place count 1712 transition count 2660
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3601 place count 1712 transition count 2624
Deduced a syphon composed of 36 places in 18 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3673 place count 1676 transition count 2624
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3675 place count 1674 transition count 2615
Iterating global reduction 5 with 2 rules applied. Total rules applied 3677 place count 1674 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3678 place count 1673 transition count 2607
Iterating global reduction 5 with 1 rules applied. Total rules applied 3679 place count 1673 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3680 place count 1672 transition count 2599
Iterating global reduction 5 with 1 rules applied. Total rules applied 3681 place count 1672 transition count 2599
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3682 place count 1671 transition count 2591
Iterating global reduction 5 with 1 rules applied. Total rules applied 3683 place count 1671 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3684 place count 1670 transition count 2583
Iterating global reduction 5 with 1 rules applied. Total rules applied 3685 place count 1670 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3686 place count 1669 transition count 2575
Iterating global reduction 5 with 1 rules applied. Total rules applied 3687 place count 1669 transition count 2575
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3688 place count 1668 transition count 2567
Iterating global reduction 5 with 1 rules applied. Total rules applied 3689 place count 1668 transition count 2567
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3690 place count 1667 transition count 2559
Iterating global reduction 5 with 1 rules applied. Total rules applied 3691 place count 1667 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3692 place count 1666 transition count 2551
Iterating global reduction 5 with 1 rules applied. Total rules applied 3693 place count 1666 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3694 place count 1665 transition count 2543
Iterating global reduction 5 with 1 rules applied. Total rules applied 3695 place count 1665 transition count 2543
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3696 place count 1664 transition count 2535
Iterating global reduction 5 with 1 rules applied. Total rules applied 3697 place count 1664 transition count 2535
Performed 283 Post agglomeration using F-continuation condition.Transition count delta: 283
Deduced a syphon composed of 283 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 5 with 568 rules applied. Total rules applied 4265 place count 1379 transition count 2252
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4269 place count 1375 transition count 2248
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4274 place count 1374 transition count 2248
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 4275 place count 1374 transition count 2247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4276 place count 1373 transition count 2247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4276 place count 1373 transition count 2246
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4278 place count 1372 transition count 2246
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4280 place count 1370 transition count 2244
Iterating global reduction 7 with 2 rules applied. Total rules applied 4282 place count 1370 transition count 2244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4284 place count 1370 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4285 place count 1369 transition count 2242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4287 place count 1368 transition count 2247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4289 place count 1366 transition count 2245
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4316 place count 1348 transition count 2236
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4325 place count 1339 transition count 2236
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4325 place count 1339 transition count 2209
Deduced a syphon composed of 27 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4380 place count 1311 transition count 2209
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 11 with 18 rules applied. Total rules applied 4398 place count 1293 transition count 2209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4398 place count 1293 transition count 2208
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4400 place count 1292 transition count 2208
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 5 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 4454 place count 1265 transition count 2181
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4470 place count 1249 transition count 2165
Iterating global reduction 12 with 16 rules applied. Total rules applied 4486 place count 1249 transition count 2165
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4494 place count 1241 transition count 2157
Iterating global reduction 12 with 8 rules applied. Total rules applied 4502 place count 1241 transition count 2157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4510 place count 1241 transition count 2149
Applied a total of 4510 rules in 1947 ms. Remains 1241 /3582 variables (removed 2341) and now considering 2149/4393 (removed 2244) transitions.
// Phase 1: matrix 2149 rows 1241 cols
[2023-03-11 03:13:43] [INFO ] Computed 204 place invariants in 31 ms
[2023-03-11 03:13:44] [INFO ] Implicit Places using invariants in 1011 ms returned [1, 18, 19, 31, 48, 66, 141, 151, 152, 154, 171, 189, 209, 262, 263, 275, 276, 278, 295, 313, 332, 384, 385, 397, 398, 400, 417, 435, 455, 506, 507, 519, 520, 522, 539, 557, 577, 628, 629, 641, 642, 644, 661, 679, 699, 748, 755, 756, 768, 771, 773, 790, 808, 828, 879, 880, 892, 893, 895, 912, 930, 950, 1001, 1002, 1014, 1015, 1017, 1034, 1052, 1072, 1123, 1124, 1127, 1138, 1139, 1140, 1158, 1179, 1180, 1181, 1182]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1027 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1160/3582 places, 2149/4393 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1160 transition count 2001
Reduce places removed 148 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 150 rules applied. Total rules applied 298 place count 1012 transition count 1999
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 1010 transition count 1999
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 300 place count 1010 transition count 1956
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 387 place count 966 transition count 1956
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 399 place count 962 transition count 1948
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 407 place count 954 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 410 place count 951 transition count 1945
Iterating global reduction 5 with 3 rules applied. Total rules applied 413 place count 951 transition count 1945
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 416 place count 951 transition count 1942
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 554 place count 882 transition count 1873
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 558 place count 880 transition count 1874
Applied a total of 558 rules in 154 ms. Remains 880 /1160 variables (removed 280) and now considering 1874/2149 (removed 275) transitions.
// Phase 1: matrix 1874 rows 880 cols
[2023-03-11 03:13:44] [INFO ] Computed 118 place invariants in 13 ms
[2023-03-11 03:13:45] [INFO ] Implicit Places using invariants in 858 ms returned [92, 98, 103, 181, 187, 192, 269, 275, 280, 357, 363, 368, 445, 451, 456, 533, 539, 544, 625, 631, 636, 713, 719, 724, 801, 807, 812, 877]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 860 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 852/3582 places, 1874/4393 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 852 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 851 transition count 1873
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 833 transition count 1855
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 833 transition count 1855
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 815 transition count 1837
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 815 transition count 1837
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 806 transition count 1828
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 806 transition count 1828
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 797 transition count 1819
Applied a total of 110 rules in 140 ms. Remains 797 /852 variables (removed 55) and now considering 1819/1874 (removed 55) transitions.
// Phase 1: matrix 1819 rows 797 cols
[2023-03-11 03:13:45] [INFO ] Computed 90 place invariants in 46 ms
[2023-03-11 03:13:46] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-11 03:13:46] [INFO ] Invariant cache hit.
[2023-03-11 03:13:48] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 797/3582 places, 1819/4393 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7392 ms. Remains : 797/3582 places, 1819/4393 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s492 1) (EQ s502 1)), p2:(EQ s160 1), p0:(NEQ s73 1)], nbAcceptance=2, 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 1074 reset in 365 ms.
Product exploration explored 100000 steps with 1107 reset in 483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 609 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 119736 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119736 steps, saw 30651 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 03:13:54] [INFO ] Invariant cache hit.
[2023-03-11 03:13:54] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-11 03:13:54] [INFO ] [Real]Absence check using 15 positive and 75 generalized place invariants in 42 ms returned sat
[2023-03-11 03:13:54] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:13:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-11 03:13:55] [INFO ] [Nat]Absence check using 15 positive and 75 generalized place invariants in 46 ms returned sat
[2023-03-11 03:13:57] [INFO ] After 2203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:13:58] [INFO ] After 2958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-11 03:13:58] [INFO ] After 3831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 306 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1819/1819 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 797 transition count 1774
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 98 place count 752 transition count 1766
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 125 place count 752 transition count 1739
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 152 place count 725 transition count 1739
Applied a total of 152 rules in 100 ms. Remains 725 /797 variables (removed 72) and now considering 1739/1819 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 725/797 places, 1739/1819 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 131697 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131697 steps, saw 33466 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1739 rows 725 cols
[2023-03-11 03:14:02] [INFO ] Computed 90 place invariants in 12 ms
[2023-03-11 03:14:02] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-11 03:14:02] [INFO ] [Real]Absence check using 15 positive and 75 generalized place invariants in 33 ms returned sat
[2023-03-11 03:14:03] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-03-11 03:14:03] [INFO ] [Nat]Absence check using 15 positive and 75 generalized place invariants in 112 ms returned sat
[2023-03-11 03:14:05] [INFO ] After 1971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:06] [INFO ] After 2663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 371 ms.
[2023-03-11 03:14:06] [INFO ] After 3450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 4 out of 725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 725/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 35 ms. Remains 725 /725 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 725/725 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 725/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 29 ms. Remains 725 /725 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:14:06] [INFO ] Invariant cache hit.
[2023-03-11 03:14:08] [INFO ] Implicit Places using invariants in 1818 ms returned [93, 94, 165, 166, 236, 237, 307, 308, 378, 379, 451, 452, 524, 525, 595, 596]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1821 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 709/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 31 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1881 ms. Remains : 709/725 places, 1739/1739 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 165771 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165771 steps, saw 43449 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1739 rows 709 cols
[2023-03-11 03:14:12] [INFO ] Computed 74 place invariants in 12 ms
[2023-03-11 03:14:12] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-11 03:14:12] [INFO ] [Real]Absence check using 14 positive and 60 generalized place invariants in 108 ms returned sat
[2023-03-11 03:14:12] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 03:14:12] [INFO ] [Nat]Absence check using 14 positive and 60 generalized place invariants in 39 ms returned sat
[2023-03-11 03:14:14] [INFO ] After 1957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:15] [INFO ] After 2664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-11 03:14:15] [INFO ] After 3435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 264 ms.
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 28 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 709/709 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 28 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:14:16] [INFO ] Invariant cache hit.
[2023-03-11 03:14:16] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-11 03:14:16] [INFO ] Invariant cache hit.
[2023-03-11 03:14:19] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2766 ms to find 0 implicit places.
[2023-03-11 03:14:19] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-11 03:14:19] [INFO ] Invariant cache hit.
[2023-03-11 03:14:19] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3582 ms. Remains : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 30 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-11 03:14:19] [INFO ] Invariant cache hit.
[2023-03-11 03:14:20] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 03:14:20] [INFO ] [Real]Absence check using 14 positive and 60 generalized place invariants in 52 ms returned sat
[2023-03-11 03:14:20] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 03:14:20] [INFO ] [Nat]Absence check using 14 positive and 60 generalized place invariants in 44 ms returned sat
[2023-03-11 03:14:22] [INFO ] After 2160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:23] [INFO ] After 2963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-11 03:14:23] [INFO ] After 3713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 605 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1819/1819 transitions.
Applied a total of 0 rules in 68 ms. Remains 797 /797 variables (removed 0) and now considering 1819/1819 (removed 0) transitions.
// Phase 1: matrix 1819 rows 797 cols
[2023-03-11 03:14:24] [INFO ] Computed 90 place invariants in 16 ms
[2023-03-11 03:14:25] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-11 03:14:25] [INFO ] Invariant cache hit.
[2023-03-11 03:14:28] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2023-03-11 03:14:28] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 03:14:28] [INFO ] Invariant cache hit.
[2023-03-11 03:14:29] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4341 ms. Remains : 797/797 places, 1819/1819 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 737 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 149205 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149205 steps, saw 42173 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 03:14:33] [INFO ] Invariant cache hit.
[2023-03-11 03:14:34] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 03:14:34] [INFO ] [Real]Absence check using 15 positive and 75 generalized place invariants in 61 ms returned sat
[2023-03-11 03:14:34] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:14:34] [INFO ] [Nat]Absence check using 15 positive and 75 generalized place invariants in 47 ms returned sat
[2023-03-11 03:14:36] [INFO ] After 1799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:37] [INFO ] After 2672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-11 03:14:37] [INFO ] After 3600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 451 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1819/1819 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 797 transition count 1774
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 98 place count 752 transition count 1766
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 125 place count 752 transition count 1739
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 152 place count 725 transition count 1739
Applied a total of 152 rules in 90 ms. Remains 725 /797 variables (removed 72) and now considering 1739/1819 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 725/797 places, 1739/1819 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 146415 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146415 steps, saw 37747 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1739 rows 725 cols
[2023-03-11 03:14:42] [INFO ] Computed 90 place invariants in 15 ms
[2023-03-11 03:14:42] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-11 03:14:42] [INFO ] [Real]Absence check using 15 positive and 75 generalized place invariants in 46 ms returned sat
[2023-03-11 03:14:42] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-11 03:14:42] [INFO ] [Nat]Absence check using 15 positive and 75 generalized place invariants in 41 ms returned sat
[2023-03-11 03:14:44] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:45] [INFO ] After 2534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-11 03:14:45] [INFO ] After 3314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 336 ms.
Support contains 4 out of 725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 725/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 33 ms. Remains 725 /725 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 725/725 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 725/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 29 ms. Remains 725 /725 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:14:46] [INFO ] Invariant cache hit.
[2023-03-11 03:14:46] [INFO ] Implicit Places using invariants in 671 ms returned [93, 94, 165, 166, 236, 237, 307, 308, 378, 379, 451, 452, 524, 525, 595, 596]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 688 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 709/725 places, 1739/1739 transitions.
Applied a total of 0 rules in 65 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 782 ms. Remains : 709/725 places, 1739/1739 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 168881 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168881 steps, saw 44409 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1739 rows 709 cols
[2023-03-11 03:14:50] [INFO ] Computed 74 place invariants in 12 ms
[2023-03-11 03:14:50] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 03:14:50] [INFO ] [Real]Absence check using 14 positive and 60 generalized place invariants in 39 ms returned sat
[2023-03-11 03:14:50] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:14:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 03:14:50] [INFO ] [Nat]Absence check using 14 positive and 60 generalized place invariants in 123 ms returned sat
[2023-03-11 03:14:53] [INFO ] After 2332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:14:54] [INFO ] After 3097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-11 03:14:54] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 308 ms.
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 26 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 709/709 places, 1739/1739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 26 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
[2023-03-11 03:14:55] [INFO ] Invariant cache hit.
[2023-03-11 03:14:55] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-11 03:14:55] [INFO ] Invariant cache hit.
[2023-03-11 03:14:59] [INFO ] Implicit Places using invariants and state equation in 3629 ms returned []
Implicit Place search using SMT with State Equation took 4226 ms to find 0 implicit places.
[2023-03-11 03:14:59] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 03:14:59] [INFO ] Invariant cache hit.
[2023-03-11 03:15:00] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5184 ms. Remains : 709/709 places, 1739/1739 transitions.
Applied a total of 0 rules in 36 ms. Remains 709 /709 variables (removed 0) and now considering 1739/1739 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-11 03:15:00] [INFO ] Invariant cache hit.
[2023-03-11 03:15:00] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 03:15:00] [INFO ] [Real]Absence check using 14 positive and 60 generalized place invariants in 47 ms returned sat
[2023-03-11 03:15:00] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:15:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-11 03:15:01] [INFO ] [Nat]Absence check using 14 positive and 60 generalized place invariants in 79 ms returned sat
[2023-03-11 03:15:03] [INFO ] After 2682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:15:04] [INFO ] After 3272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-11 03:15:04] [INFO ] After 4134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 464 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1090 reset in 354 ms.
Product exploration explored 100000 steps with 1100 reset in 390 ms.
Built C files in :
/tmp/ltsmin12738754260433651186
[2023-03-11 03:15:06] [INFO ] Too many transitions (1819) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:15:06] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12738754260433651186
Running compilation step : cd /tmp/ltsmin12738754260433651186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12738754260433651186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12738754260433651186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1819/1819 transitions.
Applied a total of 0 rules in 74 ms. Remains 797 /797 variables (removed 0) and now considering 1819/1819 (removed 0) transitions.
// Phase 1: matrix 1819 rows 797 cols
[2023-03-11 03:15:10] [INFO ] Computed 90 place invariants in 15 ms
[2023-03-11 03:15:11] [INFO ] Implicit Places using invariants in 927 ms returned []
[2023-03-11 03:15:11] [INFO ] Invariant cache hit.
[2023-03-11 03:15:13] [INFO ] Implicit Places using invariants and state equation in 2863 ms returned []
Implicit Place search using SMT with State Equation took 3805 ms to find 0 implicit places.
[2023-03-11 03:15:13] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 03:15:13] [INFO ] Invariant cache hit.
[2023-03-11 03:15:14] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4710 ms. Remains : 797/797 places, 1819/1819 transitions.
Built C files in :
/tmp/ltsmin6806547554888158715
[2023-03-11 03:15:14] [INFO ] Too many transitions (1819) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:15:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6806547554888158715
Running compilation step : cd /tmp/ltsmin6806547554888158715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6806547554888158715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6806547554888158715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 03:15:17] [INFO ] Flatten gal took : 61 ms
[2023-03-11 03:15:17] [INFO ] Flatten gal took : 64 ms
[2023-03-11 03:15:17] [INFO ] Time to serialize gal into /tmp/LTL3302134540232734165.gal : 17 ms
[2023-03-11 03:15:17] [INFO ] Time to serialize properties into /tmp/LTL13202774573494087779.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3302134540232734165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3275206294992144154.hoa' '-atoms' '/tmp/LTL13202774573494087779.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13202774573494087779.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3275206294992144154.hoa
Detected timeout of ITS tools.
[2023-03-11 03:15:33] [INFO ] Flatten gal took : 64 ms
[2023-03-11 03:15:33] [INFO ] Flatten gal took : 69 ms
[2023-03-11 03:15:33] [INFO ] Time to serialize gal into /tmp/LTL6498904626375890136.gal : 9 ms
[2023-03-11 03:15:33] [INFO ] Time to serialize properties into /tmp/LTL12796362839165866604.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6498904626375890136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12796362839165866604.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p218!=1)")U((G("(p218!=1)"))||(("(p218!=1)")&&((G("(p641==1)"))||("((p2381==1)&&(p2448==1))"))))))))
Formula 0 simplified : FG((!"((p2381==1)&&(p2448==1))" & F!"(p641==1)") U !"(p218!=1)")
Detected timeout of ITS tools.
[2023-03-11 03:15:48] [INFO ] Flatten gal took : 76 ms
[2023-03-11 03:15:48] [INFO ] Applying decomposition
[2023-03-11 03:15:48] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15935055747942445993.txt' '-o' '/tmp/graph15935055747942445993.bin' '-w' '/tmp/graph15935055747942445993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15935055747942445993.bin' '-l' '-1' '-v' '-w' '/tmp/graph15935055747942445993.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:15:48] [INFO ] Decomposing Gal with order
[2023-03-11 03:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:15:48] [INFO ] Removed a total of 3546 redundant transitions.
[2023-03-11 03:15:48] [INFO ] Flatten gal took : 88 ms
[2023-03-11 03:15:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 24 ms.
[2023-03-11 03:15:48] [INFO ] Time to serialize gal into /tmp/LTL3446629248810661539.gal : 10 ms
[2023-03-11 03:15:48] [INFO ] Time to serialize properties into /tmp/LTL13709558739626292781.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3446629248810661539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13709558739626292781.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i2.u25.p218!=1)")U((G("(i2.u25.p218!=1)"))||(("(i2.u25.p218!=1)")&&((G("(i3.u45.p641==1)"))||("((i12.u119.p2381==1)&&(i12.u1...177
Formula 0 simplified : FG((!"((i12.u119.p2381==1)&&(i12.u120.p2448==1))" & F!"(i3.u45.p641==1)") U !"(i2.u25.p218!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8023375065886098140
[2023-03-11 03:16:04] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8023375065886098140
Running compilation step : cd /tmp/ltsmin8023375065886098140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8023375065886098140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8023375065886098140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09b-LTLFireability-02 finished in 145584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3581 transition count 3726
Reduce places removed 666 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 671 rules applied. Total rules applied 1337 place count 2915 transition count 3721
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1340 place count 2912 transition count 3721
Performed 972 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 972 Pre rules applied. Total rules applied 1340 place count 2912 transition count 2749
Deduced a syphon composed of 972 places in 8 ms
Ensure Unique test removed 94 places
Reduce places removed 1066 places and 0 transitions.
Iterating global reduction 3 with 2038 rules applied. Total rules applied 3378 place count 1846 transition count 2749
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3445 place count 1837 transition count 2691
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3503 place count 1779 transition count 2691
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3503 place count 1779 transition count 2654
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3614 place count 1705 transition count 2654
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3614 place count 1705 transition count 2618
Deduced a syphon composed of 36 places in 12 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3686 place count 1669 transition count 2618
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3689 place count 1666 transition count 2608
Iterating global reduction 5 with 3 rules applied. Total rules applied 3692 place count 1666 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3693 place count 1665 transition count 2600
Iterating global reduction 5 with 1 rules applied. Total rules applied 3694 place count 1665 transition count 2600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3695 place count 1664 transition count 2592
Iterating global reduction 5 with 1 rules applied. Total rules applied 3696 place count 1664 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3697 place count 1663 transition count 2584
Iterating global reduction 5 with 1 rules applied. Total rules applied 3698 place count 1663 transition count 2584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3699 place count 1662 transition count 2576
Iterating global reduction 5 with 1 rules applied. Total rules applied 3700 place count 1662 transition count 2576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3701 place count 1661 transition count 2568
Iterating global reduction 5 with 1 rules applied. Total rules applied 3702 place count 1661 transition count 2568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3703 place count 1660 transition count 2560
Iterating global reduction 5 with 1 rules applied. Total rules applied 3704 place count 1660 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3705 place count 1659 transition count 2552
Iterating global reduction 5 with 1 rules applied. Total rules applied 3706 place count 1659 transition count 2552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3707 place count 1658 transition count 2544
Iterating global reduction 5 with 1 rules applied. Total rules applied 3708 place count 1658 transition count 2544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3709 place count 1657 transition count 2536
Iterating global reduction 5 with 1 rules applied. Total rules applied 3710 place count 1657 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3711 place count 1656 transition count 2528
Iterating global reduction 5 with 1 rules applied. Total rules applied 3712 place count 1656 transition count 2528
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 281
Deduced a syphon composed of 281 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 5 with 564 rules applied. Total rules applied 4276 place count 1373 transition count 2247
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4280 place count 1369 transition count 2243
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4285 place count 1368 transition count 2243
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 4286 place count 1368 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4287 place count 1367 transition count 2242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4287 place count 1367 transition count 2241
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4289 place count 1366 transition count 2241
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4291 place count 1364 transition count 2239
Iterating global reduction 7 with 2 rules applied. Total rules applied 4293 place count 1364 transition count 2239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4295 place count 1364 transition count 2237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4296 place count 1363 transition count 2237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4298 place count 1362 transition count 2242
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4299 place count 1362 transition count 2242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4301 place count 1360 transition count 2240
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4328 place count 1342 transition count 2231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4337 place count 1333 transition count 2231
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4337 place count 1333 transition count 2204
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4392 place count 1305 transition count 2204
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 4411 place count 1286 transition count 2204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4411 place count 1286 transition count 2203
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4413 place count 1285 transition count 2203
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 4469 place count 1257 transition count 2175
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 4487 place count 1239 transition count 2157
Iterating global reduction 12 with 18 rules applied. Total rules applied 4505 place count 1239 transition count 2157
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 4514 place count 1230 transition count 2148
Iterating global reduction 12 with 9 rules applied. Total rules applied 4523 place count 1230 transition count 2148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4532 place count 1230 transition count 2139
Applied a total of 4532 rules in 2002 ms. Remains 1230 /3582 variables (removed 2352) and now considering 2139/4393 (removed 2254) transitions.
// Phase 1: matrix 2139 rows 1230 cols
[2023-03-11 03:16:09] [INFO ] Computed 202 place invariants in 48 ms
[2023-03-11 03:16:10] [INFO ] Implicit Places using invariants in 1261 ms returned [1, 18, 19, 33, 50, 68, 88, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 328, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 1003, 1004, 1006, 1023, 1041, 1061, 1112, 1113, 1116, 1127, 1128, 1129, 1147, 1168, 1169, 1170, 1171]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1276 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1149/3582 places, 2139/4393 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1149 transition count 1991
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 296 place count 1001 transition count 1991
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 296 place count 1001 transition count 1948
Deduced a syphon composed of 43 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 383 place count 957 transition count 1948
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 395 place count 953 transition count 1940
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 403 place count 945 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 406 place count 942 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 409 place count 942 transition count 1937
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 412 place count 942 transition count 1934
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 5 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 550 place count 873 transition count 1865
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 554 place count 871 transition count 1866
Applied a total of 554 rules in 238 ms. Remains 871 /1149 variables (removed 278) and now considering 1866/2139 (removed 273) transitions.
// Phase 1: matrix 1866 rows 871 cols
[2023-03-11 03:16:10] [INFO ] Computed 116 place invariants in 49 ms
[2023-03-11 03:16:11] [INFO ] Implicit Places using invariants in 955 ms returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 792, 798, 803, 868]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 982 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 843/3582 places, 1866/4393 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 843 transition count 1865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 842 transition count 1865
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 824 transition count 1847
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 824 transition count 1847
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 806 transition count 1829
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 806 transition count 1829
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 797 transition count 1820
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 797 transition count 1820
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 788 transition count 1811
Applied a total of 110 rules in 163 ms. Remains 788 /843 variables (removed 55) and now considering 1811/1866 (removed 55) transitions.
// Phase 1: matrix 1811 rows 788 cols
[2023-03-11 03:16:11] [INFO ] Computed 88 place invariants in 33 ms
[2023-03-11 03:16:12] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-11 03:16:12] [INFO ] Invariant cache hit.
[2023-03-11 03:16:14] [INFO ] Implicit Places using invariants and state equation in 2127 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 788/3582 places, 1811/4393 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7608 ms. Remains : 788/3582 places, 1811/4393 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-03 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 s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-03 finished in 7721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 3582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 665 transitions
Trivial Post-agglo rules discarded 665 transitions
Performed 665 trivial Post agglomeration. Transition count delta: 665
Iterating post reduction 0 with 665 rules applied. Total rules applied 665 place count 3581 transition count 3727
Reduce places removed 665 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 668 rules applied. Total rules applied 1333 place count 2916 transition count 3724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1335 place count 2914 transition count 3724
Performed 972 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 972 Pre rules applied. Total rules applied 1335 place count 2914 transition count 2752
Deduced a syphon composed of 972 places in 8 ms
Ensure Unique test removed 93 places
Reduce places removed 1065 places and 0 transitions.
Iterating global reduction 3 with 2037 rules applied. Total rules applied 3372 place count 1849 transition count 2752
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 3 with 66 rules applied. Total rules applied 3438 place count 1840 transition count 2695
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 3495 place count 1783 transition count 2695
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3495 place count 1783 transition count 2658
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3606 place count 1709 transition count 2658
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3606 place count 1709 transition count 2622
Deduced a syphon composed of 36 places in 8 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3678 place count 1673 transition count 2622
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3681 place count 1670 transition count 2612
Iterating global reduction 5 with 3 rules applied. Total rules applied 3684 place count 1670 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3685 place count 1669 transition count 2604
Iterating global reduction 5 with 1 rules applied. Total rules applied 3686 place count 1669 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3687 place count 1668 transition count 2596
Iterating global reduction 5 with 1 rules applied. Total rules applied 3688 place count 1668 transition count 2596
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3689 place count 1667 transition count 2588
Iterating global reduction 5 with 1 rules applied. Total rules applied 3690 place count 1667 transition count 2588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3691 place count 1666 transition count 2580
Iterating global reduction 5 with 1 rules applied. Total rules applied 3692 place count 1666 transition count 2580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3693 place count 1665 transition count 2572
Iterating global reduction 5 with 1 rules applied. Total rules applied 3694 place count 1665 transition count 2572
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3695 place count 1664 transition count 2564
Iterating global reduction 5 with 1 rules applied. Total rules applied 3696 place count 1664 transition count 2564
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3697 place count 1663 transition count 2556
Iterating global reduction 5 with 1 rules applied. Total rules applied 3698 place count 1663 transition count 2556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3699 place count 1662 transition count 2548
Iterating global reduction 5 with 1 rules applied. Total rules applied 3700 place count 1662 transition count 2548
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3701 place count 1661 transition count 2540
Iterating global reduction 5 with 1 rules applied. Total rules applied 3702 place count 1661 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3703 place count 1660 transition count 2532
Iterating global reduction 5 with 1 rules applied. Total rules applied 3704 place count 1660 transition count 2532
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 279
Deduced a syphon composed of 279 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 5 with 560 rules applied. Total rules applied 4264 place count 1379 transition count 2253
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4268 place count 1375 transition count 2249
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4273 place count 1374 transition count 2249
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 4274 place count 1374 transition count 2248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4275 place count 1373 transition count 2248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4275 place count 1373 transition count 2247
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4277 place count 1372 transition count 2247
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4279 place count 1370 transition count 2245
Iterating global reduction 7 with 2 rules applied. Total rules applied 4281 place count 1370 transition count 2245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4283 place count 1370 transition count 2243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4284 place count 1369 transition count 2243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4286 place count 1368 transition count 2248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4288 place count 1366 transition count 2246
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 9 with 22 rules applied. Total rules applied 4310 place count 1351 transition count 2239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 4317 place count 1344 transition count 2239
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 23 Pre rules applied. Total rules applied 4317 place count 1344 transition count 2216
Deduced a syphon composed of 23 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 47 rules applied. Total rules applied 4364 place count 1320 transition count 2216
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 4380 place count 1304 transition count 2216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4380 place count 1304 transition count 2215
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4382 place count 1303 transition count 2215
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 4430 place count 1279 transition count 2191
Discarding 15 places :
Symmetric choice reduction at 12 with 15 rule applications. Total rules 4445 place count 1264 transition count 2176
Iterating global reduction 12 with 15 rules applied. Total rules applied 4460 place count 1264 transition count 2176
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4468 place count 1256 transition count 2168
Iterating global reduction 12 with 8 rules applied. Total rules applied 4476 place count 1256 transition count 2168
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4484 place count 1256 transition count 2160
Applied a total of 4484 rules in 1672 ms. Remains 1256 /3582 variables (removed 2326) and now considering 2160/4393 (removed 2233) transitions.
// Phase 1: matrix 2160 rows 1256 cols
[2023-03-11 03:16:16] [INFO ] Computed 209 place invariants in 52 ms
[2023-03-11 03:16:18] [INFO ] Implicit Places using invariants in 1799 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 386, 387, 399, 400, 401, 402, 405, 441, 461, 512, 513, 525, 526, 528, 545, 563, 583, 634, 635, 647, 648, 650, 667, 685, 705, 756, 757, 769, 770, 772, 789, 807, 827, 878, 879, 891, 892, 895, 912, 930, 1026, 1029, 1030, 1032, 1049, 1067, 1087, 1138, 1139, 1142, 1153, 1154, 1155, 1173, 1194, 1195, 1196, 1197]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1803 ms to find 80 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1176/3582 places, 2160/4393 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 1176 transition count 2015
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 290 place count 1031 transition count 2015
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 290 place count 1031 transition count 1970
Deduced a syphon composed of 45 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 381 place count 985 transition count 1970
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 394 place count 980 transition count 1962
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 402 place count 972 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 405 place count 969 transition count 1959
Iterating global reduction 4 with 3 rules applied. Total rules applied 408 place count 969 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 411 place count 969 transition count 1956
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 547 place count 901 transition count 1888
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 551 place count 899 transition count 1889
Applied a total of 551 rules in 197 ms. Remains 899 /1176 variables (removed 277) and now considering 1889/2160 (removed 271) transitions.
// Phase 1: matrix 1889 rows 899 cols
[2023-03-11 03:16:18] [INFO ] Computed 123 place invariants in 14 ms
[2023-03-11 03:16:19] [INFO ] Implicit Places using invariants in 901 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 361, 369, 375, 452, 458, 463, 540, 546, 551, 628, 634, 639, 723, 729, 734, 820, 826, 831, 896]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 926 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 871/3582 places, 1889/4393 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 871 transition count 1888
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 870 transition count 1888
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 852 transition count 1870
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 852 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 834 transition count 1852
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 834 transition count 1852
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 824 transition count 1842
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 824 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 823 transition count 1841
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 823 transition count 1841
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 822 transition count 1840
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 822 transition count 1840
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 116 place count 813 transition count 1831
Applied a total of 116 rules in 224 ms. Remains 813 /871 variables (removed 58) and now considering 1831/1889 (removed 58) transitions.
// Phase 1: matrix 1831 rows 813 cols
[2023-03-11 03:16:19] [INFO ] Computed 95 place invariants in 35 ms
[2023-03-11 03:16:20] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2023-03-11 03:16:20] [INFO ] Invariant cache hit.
[2023-03-11 03:16:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 03:16:23] [INFO ] Implicit Places using invariants and state equation in 2858 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 813/3582 places, 1831/4393 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8764 ms. Remains : 813/3582 places, 1831/4393 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), 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:(AND (EQ s676 0) (OR (EQ s278 0) (EQ s329 0))), p1:(EQ s247 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-04 finished in 8993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3579 transition count 4383
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3579 transition count 4383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 3576 transition count 4373
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 3576 transition count 4373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 3576 transition count 4372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 3575 transition count 4371
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4363
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4363
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4355
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4346
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4346
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4338
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4329
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4321
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4312
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4304
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4295
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4295
Applied a total of 41 rules in 5711 ms. Remains 3562 /3582 variables (removed 20) and now considering 4295/4393 (removed 98) transitions.
// Phase 1: matrix 4295 rows 3562 cols
[2023-03-11 03:16:29] [INFO ] Computed 383 place invariants in 84 ms
[2023-03-11 03:16:32] [INFO ] Implicit Places using invariants in 2745 ms returned []
[2023-03-11 03:16:32] [INFO ] Invariant cache hit.
[2023-03-11 03:16:35] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 5944 ms to find 0 implicit places.
[2023-03-11 03:16:35] [INFO ] Invariant cache hit.
[2023-03-11 03:16:40] [INFO ] Dead Transitions using invariants and state equation in 4493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3562/3582 places, 4295/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16168 ms. Remains : 3562/3582 places, 4295/4393 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s917 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-05 finished in 16405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5476 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
// Phase 1: matrix 4294 rows 3561 cols
[2023-03-11 03:16:45] [INFO ] Computed 383 place invariants in 81 ms
[2023-03-11 03:16:48] [INFO ] Implicit Places using invariants in 2833 ms returned []
[2023-03-11 03:16:48] [INFO ] Invariant cache hit.
[2023-03-11 03:16:50] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 4488 ms to find 0 implicit places.
[2023-03-11 03:16:50] [INFO ] Invariant cache hit.
[2023-03-11 03:16:54] [INFO ] Dead Transitions using invariants and state equation in 3993 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13975 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-08 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 s1130 1) (EQ s1465 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 697 steps with 0 reset in 11 ms.
FORMULA ASLink-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-08 finished in 14167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5465 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
[2023-03-11 03:16:59] [INFO ] Invariant cache hit.
[2023-03-11 03:17:03] [INFO ] Implicit Places using invariants in 3280 ms returned []
[2023-03-11 03:17:03] [INFO ] Invariant cache hit.
[2023-03-11 03:17:07] [INFO ] Implicit Places using invariants and state equation in 4280 ms returned []
Implicit Place search using SMT with State Equation took 7565 ms to find 0 implicit places.
[2023-03-11 03:17:07] [INFO ] Invariant cache hit.
[2023-03-11 03:17:12] [INFO ] Dead Transitions using invariants and state equation in 4701 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17748 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s410 1) (EQ s749 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-09 finished in 17989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 667 transitions
Trivial Post-agglo rules discarded 667 transitions
Performed 667 trivial Post agglomeration. Transition count delta: 667
Iterating post reduction 0 with 667 rules applied. Total rules applied 667 place count 3581 transition count 3725
Reduce places removed 667 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 672 rules applied. Total rules applied 1339 place count 2914 transition count 3720
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1342 place count 2911 transition count 3720
Performed 972 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 972 Pre rules applied. Total rules applied 1342 place count 2911 transition count 2748
Deduced a syphon composed of 972 places in 8 ms
Ensure Unique test removed 94 places
Reduce places removed 1066 places and 0 transitions.
Iterating global reduction 3 with 2038 rules applied. Total rules applied 3380 place count 1845 transition count 2748
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3447 place count 1836 transition count 2690
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3505 place count 1778 transition count 2690
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3505 place count 1778 transition count 2653
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3616 place count 1704 transition count 2653
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3616 place count 1704 transition count 2617
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3688 place count 1668 transition count 2617
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3690 place count 1666 transition count 2608
Iterating global reduction 5 with 2 rules applied. Total rules applied 3692 place count 1666 transition count 2608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3693 place count 1665 transition count 2600
Iterating global reduction 5 with 1 rules applied. Total rules applied 3694 place count 1665 transition count 2600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3695 place count 1664 transition count 2592
Iterating global reduction 5 with 1 rules applied. Total rules applied 3696 place count 1664 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3697 place count 1663 transition count 2584
Iterating global reduction 5 with 1 rules applied. Total rules applied 3698 place count 1663 transition count 2584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3699 place count 1662 transition count 2576
Iterating global reduction 5 with 1 rules applied. Total rules applied 3700 place count 1662 transition count 2576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3701 place count 1661 transition count 2568
Iterating global reduction 5 with 1 rules applied. Total rules applied 3702 place count 1661 transition count 2568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3703 place count 1660 transition count 2560
Iterating global reduction 5 with 1 rules applied. Total rules applied 3704 place count 1660 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3705 place count 1659 transition count 2552
Iterating global reduction 5 with 1 rules applied. Total rules applied 3706 place count 1659 transition count 2552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3707 place count 1658 transition count 2544
Iterating global reduction 5 with 1 rules applied. Total rules applied 3708 place count 1658 transition count 2544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3709 place count 1657 transition count 2536
Iterating global reduction 5 with 1 rules applied. Total rules applied 3710 place count 1657 transition count 2536
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3711 place count 1656 transition count 2528
Iterating global reduction 5 with 1 rules applied. Total rules applied 3712 place count 1656 transition count 2528
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 5 with 566 rules applied. Total rules applied 4278 place count 1372 transition count 2246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4282 place count 1368 transition count 2242
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4287 place count 1367 transition count 2242
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 4288 place count 1367 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4289 place count 1366 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4289 place count 1366 transition count 2240
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4291 place count 1365 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4293 place count 1363 transition count 2238
Iterating global reduction 7 with 2 rules applied. Total rules applied 4295 place count 1363 transition count 2238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4297 place count 1363 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4298 place count 1362 transition count 2236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4300 place count 1361 transition count 2241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4302 place count 1359 transition count 2239
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4329 place count 1341 transition count 2230
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4338 place count 1332 transition count 2230
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4338 place count 1332 transition count 2203
Deduced a syphon composed of 27 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4393 place count 1304 transition count 2203
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 4412 place count 1285 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4412 place count 1285 transition count 2202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4414 place count 1284 transition count 2202
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 4470 place count 1256 transition count 2174
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 4487 place count 1239 transition count 2157
Iterating global reduction 12 with 17 rules applied. Total rules applied 4504 place count 1239 transition count 2157
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 4513 place count 1230 transition count 2148
Iterating global reduction 12 with 9 rules applied. Total rules applied 4522 place count 1230 transition count 2148
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4531 place count 1230 transition count 2139
Applied a total of 4531 rules in 1751 ms. Remains 1230 /3582 variables (removed 2352) and now considering 2139/4393 (removed 2254) transitions.
// Phase 1: matrix 2139 rows 1230 cols
[2023-03-11 03:17:14] [INFO ] Computed 202 place invariants in 37 ms
[2023-03-11 03:17:15] [INFO ] Implicit Places using invariants in 1595 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 1003, 1004, 1006, 1023, 1041, 1061, 1112, 1113, 1116, 1127, 1128, 1129, 1147, 1168, 1169, 1170, 1171]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1619 ms to find 81 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1149/3582 places, 2139/4393 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1149 transition count 1990
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1000 transition count 1990
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 298 place count 1000 transition count 1947
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 385 place count 956 transition count 1947
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 397 place count 952 transition count 1939
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 405 place count 944 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 408 place count 941 transition count 1936
Iterating global reduction 4 with 3 rules applied. Total rules applied 411 place count 941 transition count 1936
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 414 place count 941 transition count 1933
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 550 place count 873 transition count 1865
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 554 place count 871 transition count 1866
Applied a total of 554 rules in 180 ms. Remains 871 /1149 variables (removed 278) and now considering 1866/2139 (removed 273) transitions.
// Phase 1: matrix 1866 rows 871 cols
[2023-03-11 03:17:16] [INFO ] Computed 116 place invariants in 36 ms
[2023-03-11 03:17:17] [INFO ] Implicit Places using invariants in 1029 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 792, 798, 803, 868]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 843/3582 places, 1866/4393 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 843 transition count 1865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 842 transition count 1865
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 824 transition count 1847
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 824 transition count 1847
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 806 transition count 1829
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 806 transition count 1829
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 797 transition count 1820
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 797 transition count 1820
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 788 transition count 1811
Applied a total of 110 rules in 136 ms. Remains 788 /843 variables (removed 55) and now considering 1811/1866 (removed 55) transitions.
// Phase 1: matrix 1811 rows 788 cols
[2023-03-11 03:17:17] [INFO ] Computed 88 place invariants in 47 ms
[2023-03-11 03:17:17] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-11 03:17:17] [INFO ] Invariant cache hit.
[2023-03-11 03:17:20] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 788/3582 places, 1811/4393 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8155 ms. Remains : 788/3582 places, 1811/4393 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-11 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 s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-11 finished in 8303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)||G(p2)||G(p3)))'
Support contains 5 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5585 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
// Phase 1: matrix 4294 rows 3561 cols
[2023-03-11 03:17:26] [INFO ] Computed 383 place invariants in 46 ms
[2023-03-11 03:17:28] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2023-03-11 03:17:28] [INFO ] Invariant cache hit.
[2023-03-11 03:17:32] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 6014 ms to find 0 implicit places.
[2023-03-11 03:17:32] [INFO ] Invariant cache hit.
[2023-03-11 03:17:37] [INFO ] Dead Transitions using invariants and state equation in 4884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16500 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 729 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(AND (EQ s1555 1) (EQ s1972 1) (EQ s1006 1)), p1:(EQ s1006 0), p2:(EQ s546 0), p3:(EQ s1012 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2702 ms.
Product exploration explored 100000 steps with 50000 reset in 2639 ms.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2 (NOT p1))))
Knowledge based reduction with 19 factoid took 590 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09b-LTLFireability-12 finished in 23259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5440 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
[2023-03-11 03:17:49] [INFO ] Invariant cache hit.
[2023-03-11 03:17:51] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2023-03-11 03:17:51] [INFO ] Invariant cache hit.
[2023-03-11 03:17:54] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 5124 ms to find 0 implicit places.
[2023-03-11 03:17:54] [INFO ] Invariant cache hit.
[2023-03-11 03:17:59] [INFO ] Dead Transitions using invariants and state equation in 4585 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15163 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1746 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5713 steps with 7 reset in 74 ms.
FORMULA ASLink-PT-09b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-14 finished in 15434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3582/3582 places, 4393/4393 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3578 transition count 4382
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3578 transition count 4382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3575 transition count 4372
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3575 transition count 4372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 3575 transition count 4371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3574 transition count 4370
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3574 transition count 4370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3573 transition count 4362
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3573 transition count 4362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3572 transition count 4354
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3572 transition count 4354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3571 transition count 4353
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3571 transition count 4353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3570 transition count 4345
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3570 transition count 4345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3569 transition count 4337
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3569 transition count 4337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3568 transition count 4336
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3568 transition count 4336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 3567 transition count 4328
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 3567 transition count 4328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 3566 transition count 4320
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 3566 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 3565 transition count 4319
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 3565 transition count 4319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 3564 transition count 4311
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 3564 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 3563 transition count 4303
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 3563 transition count 4303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 3562 transition count 4302
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 3562 transition count 4302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 3561 transition count 4294
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 3561 transition count 4294
Applied a total of 43 rules in 5363 ms. Remains 3561 /3582 variables (removed 21) and now considering 4294/4393 (removed 99) transitions.
[2023-03-11 03:18:04] [INFO ] Invariant cache hit.
[2023-03-11 03:18:07] [INFO ] Implicit Places using invariants in 3120 ms returned []
[2023-03-11 03:18:07] [INFO ] Invariant cache hit.
[2023-03-11 03:18:11] [INFO ] Implicit Places using invariants and state equation in 3297 ms returned []
Implicit Place search using SMT with State Equation took 6446 ms to find 0 implicit places.
[2023-03-11 03:18:11] [INFO ] Invariant cache hit.
[2023-03-11 03:18:15] [INFO ] Dead Transitions using invariants and state equation in 4465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3561/3582 places, 4294/4393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16275 ms. Remains : 3561/3582 places, 4294/4393 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s2376 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1918 ms.
Product exploration explored 100000 steps with 33333 reset in 1834 ms.
Computed a total of 146 stabilizing places and 146 stable transitions
Computed a total of 146 stabilizing places and 146 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09b-LTLFireability-15 finished in 20413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X((p1||G(p2)))||G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&(p1||G(p2))))))))'
[2023-03-11 03:18:20] [INFO ] Flatten gal took : 152 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14136197712198321198
[2023-03-11 03:18:20] [INFO ] Too many transitions (4393) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:18:20] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14136197712198321198
Running compilation step : cd /tmp/ltsmin14136197712198321198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 03:18:20] [INFO ] Applying decomposition
[2023-03-11 03:18:20] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14568101501866708237.txt' '-o' '/tmp/graph14568101501866708237.bin' '-w' '/tmp/graph14568101501866708237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14568101501866708237.bin' '-l' '-1' '-v' '-w' '/tmp/graph14568101501866708237.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:18:21] [INFO ] Decomposing Gal with order
[2023-03-11 03:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:18:21] [INFO ] Removed a total of 3296 redundant transitions.
[2023-03-11 03:18:21] [INFO ] Flatten gal took : 224 ms
[2023-03-11 03:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 34 ms.
[2023-03-11 03:18:22] [INFO ] Time to serialize gal into /tmp/LTLFireability14459039649964520848.gal : 46 ms
[2023-03-11 03:18:22] [INFO ] Time to serialize properties into /tmp/LTLFireability13904447054598708028.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14459039649964520848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13904447054598708028.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(("(i27.u1041.p3011==1)")||(G((X(("(i30.i0.i3.u1090.p3127==1)")||(G("(i27.u1041.p3011==0)"))))||(G("(i27.u1041.p3011==1)")))))))
Formula 0 simplified : X(!"(i27.u1041.p3011==1)" & F(X(!"(i30.i0.i3.u1090.p3127==1)" & F!"(i27.u1041.p3011==0)") & F!"(i27.u1041.p3011==1)"))
Compilation finished in 14451 ms.
Running link step : cd /tmp/ltsmin14136197712198321198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin14136197712198321198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||[]((X(((LTLAPp1==true)||[]((LTLAPp2==true))))||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 03:42:10] [INFO ] Applying decomposition
[2023-03-11 03:42:11] [INFO ] Flatten gal took : 298 ms
[2023-03-11 03:42:11] [INFO ] Decomposing Gal with order
[2023-03-11 03:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:42:12] [INFO ] Removed a total of 3049 redundant transitions.
[2023-03-11 03:42:12] [INFO ] Flatten gal took : 545 ms
[2023-03-11 03:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 5007 labels/synchronizations in 406 ms.
[2023-03-11 03:42:13] [INFO ] Time to serialize gal into /tmp/LTLFireability13945053801729120874.gal : 49 ms
[2023-03-11 03:42:13] [INFO ] Time to serialize properties into /tmp/LTLFireability3061835904087827307.ltl : 45 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13945053801729120874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3061835904087827307.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(("(i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u597.p3011==1)")||(G((X(("(i0.i0.i1.i0.i0.i0.i0.i0.i1.u374.p3127==1)")||(G("(i0.i0.i1.i0.i0.i0.i...244
Formula 0 simplified : X(!"(i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u597.p3011==1)" & F(X(!"(i0.i0.i1.i0.i0.i0.i0.i0.i1.u374.p3127==1)" & F!"(i0.i0.i1.i0.i0.i0.i0.i0...232
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14136197712198321198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)||[]((X(((LTLAPp1==true)||[]((LTLAPp2==true))))||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14136197712198321198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp3==true) U ([]((LTLAPp3==true))||((LTLAPp3==true)&&((LTLAPp4==true)||[]((LTLAPp5==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 04:06:02] [INFO ] Flatten gal took : 427 ms
[2023-03-11 04:06:02] [INFO ] Input system was already deterministic with 4393 transitions.
[2023-03-11 04:06:02] [INFO ] Transformed 3582 places.
[2023-03-11 04:06:02] [INFO ] Transformed 4393 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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
[2023-03-11 04:06:33] [INFO ] Time to serialize gal into /tmp/LTLFireability463406750786046426.gal : 50 ms
[2023-03-11 04:06:33] [INFO ] Time to serialize properties into /tmp/LTLFireability7285286518283954135.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability463406750786046426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7285286518283954135.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("(p3011==1)")||(G((X(("(p3127==1)")||(G("(p3011==0)"))))||(G("(p3011==1)")))))))
Formula 0 simplified : X(!"(p3011==1)" & F(X(!"(p3127==1)" & F!"(p3011==0)") & F!"(p3011==1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13592856 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16032432 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-09b, 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 r005-oct2-167813592700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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