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.r009-oct2-167813597500163.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 ltsminxred
Input is ASLink-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:10 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.6K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:11 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.4M 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-10b-LTLCardinality-00
FORMULA_NAME ASLink-PT-10b-LTLCardinality-01
FORMULA_NAME ASLink-PT-10b-LTLCardinality-02
FORMULA_NAME ASLink-PT-10b-LTLCardinality-03
FORMULA_NAME ASLink-PT-10b-LTLCardinality-04
FORMULA_NAME ASLink-PT-10b-LTLCardinality-05
FORMULA_NAME ASLink-PT-10b-LTLCardinality-06
FORMULA_NAME ASLink-PT-10b-LTLCardinality-07
FORMULA_NAME ASLink-PT-10b-LTLCardinality-08
FORMULA_NAME ASLink-PT-10b-LTLCardinality-09
FORMULA_NAME ASLink-PT-10b-LTLCardinality-10
FORMULA_NAME ASLink-PT-10b-LTLCardinality-11
FORMULA_NAME ASLink-PT-10b-LTLCardinality-12
FORMULA_NAME ASLink-PT-10b-LTLCardinality-13
FORMULA_NAME ASLink-PT-10b-LTLCardinality-14
FORMULA_NAME ASLink-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678619025345

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:03:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 11:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:03:50] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-12 11:03:50] [INFO ] Transformed 4410 places.
[2023-03-12 11:03:50] [INFO ] Transformed 5405 transitions.
[2023-03-12 11:03:50] [INFO ] Found NUPN structural information;
[2023-03-12 11:03:50] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-10b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 4410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Discarding 274 places :
Symmetric choice reduction at 0 with 274 rule applications. Total rules 274 place count 4136 transition count 5131
Iterating global reduction 0 with 274 rules applied. Total rules applied 548 place count 4136 transition count 5131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 549 place count 4136 transition count 5130
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 656 place count 4029 transition count 4965
Iterating global reduction 1 with 107 rules applied. Total rules applied 763 place count 4029 transition count 4965
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 796 place count 4029 transition count 4932
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 810 place count 4015 transition count 4918
Iterating global reduction 2 with 14 rules applied. Total rules applied 824 place count 4015 transition count 4918
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 828 place count 4011 transition count 4907
Iterating global reduction 2 with 4 rules applied. Total rules applied 832 place count 4011 transition count 4907
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 835 place count 4008 transition count 4904
Iterating global reduction 2 with 3 rules applied. Total rules applied 838 place count 4008 transition count 4904
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 841 place count 4005 transition count 4894
Iterating global reduction 2 with 3 rules applied. Total rules applied 844 place count 4005 transition count 4894
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 845 place count 4004 transition count 4886
Iterating global reduction 2 with 1 rules applied. Total rules applied 846 place count 4004 transition count 4886
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 847 place count 4003 transition count 4885
Iterating global reduction 2 with 1 rules applied. Total rules applied 848 place count 4003 transition count 4885
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 849 place count 4002 transition count 4877
Iterating global reduction 2 with 1 rules applied. Total rules applied 850 place count 4002 transition count 4877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 851 place count 4001 transition count 4869
Iterating global reduction 2 with 1 rules applied. Total rules applied 852 place count 4001 transition count 4869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 853 place count 4000 transition count 4868
Iterating global reduction 2 with 1 rules applied. Total rules applied 854 place count 4000 transition count 4868
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 3999 transition count 4860
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 3999 transition count 4860
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 857 place count 3998 transition count 4852
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 3998 transition count 4852
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 3997 transition count 4851
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 3997 transition count 4851
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 861 place count 3996 transition count 4843
Iterating global reduction 2 with 1 rules applied. Total rules applied 862 place count 3996 transition count 4843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 3995 transition count 4835
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 3995 transition count 4835
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 865 place count 3994 transition count 4834
Iterating global reduction 2 with 1 rules applied. Total rules applied 866 place count 3994 transition count 4834
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 867 place count 3993 transition count 4826
Iterating global reduction 2 with 1 rules applied. Total rules applied 868 place count 3993 transition count 4826
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 869 place count 3992 transition count 4818
Iterating global reduction 2 with 1 rules applied. Total rules applied 870 place count 3992 transition count 4818
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 871 place count 3991 transition count 4817
Iterating global reduction 2 with 1 rules applied. Total rules applied 872 place count 3991 transition count 4817
Applied a total of 872 rules in 9152 ms. Remains 3991 /4410 variables (removed 419) and now considering 4817/5405 (removed 588) transitions.
// Phase 1: matrix 4817 rows 3991 cols
[2023-03-12 11:04:00] [INFO ] Computed 433 place invariants in 219 ms
[2023-03-12 11:04:06] [INFO ] Implicit Places using invariants in 5964 ms returned []
[2023-03-12 11:04:06] [INFO ] Invariant cache hit.
[2023-03-12 11:04:26] [INFO ] Implicit Places using invariants and state equation in 19942 ms returned [3825, 3836, 3847, 3855, 3863, 3871, 3879, 3890, 3898, 3917]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 26069 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3981/4410 places, 4817/5405 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3970 transition count 4806
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3970 transition count 4806
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 3961 transition count 4797
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 3961 transition count 4797
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 3954 transition count 4790
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 3954 transition count 4790
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 3952 transition count 4788
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 3952 transition count 4788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3951 transition count 4787
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3951 transition count 4787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3950 transition count 4786
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3950 transition count 4786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3949 transition count 4785
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3949 transition count 4785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3948 transition count 4784
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3948 transition count 4784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 3947 transition count 4783
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 3947 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 3946 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 3946 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 3945 transition count 4781
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 3945 transition count 4781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 3944 transition count 4780
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 3944 transition count 4780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3943 transition count 4779
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3943 transition count 4779
Applied a total of 76 rules in 4631 ms. Remains 3943 /3981 variables (removed 38) and now considering 4779/4817 (removed 38) transitions.
// Phase 1: matrix 4779 rows 3943 cols
[2023-03-12 11:04:31] [INFO ] Computed 423 place invariants in 152 ms
[2023-03-12 11:04:35] [INFO ] Implicit Places using invariants in 4210 ms returned []
[2023-03-12 11:04:35] [INFO ] Invariant cache hit.
[2023-03-12 11:04:38] [INFO ] Implicit Places using invariants and state equation in 3692 ms returned [3862]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7922 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3942/4410 places, 4779/5405 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3940 transition count 4777
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3940 transition count 4777
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3938 transition count 4775
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3938 transition count 4775
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3936 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3936 transition count 4773
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 3934 transition count 4771
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 3934 transition count 4771
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3933 transition count 4770
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3933 transition count 4770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 3932 transition count 4769
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 3932 transition count 4769
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 3931 transition count 4768
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 3931 transition count 4768
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 3930 transition count 4767
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 3930 transition count 4767
Applied a total of 24 rules in 2810 ms. Remains 3930 /3942 variables (removed 12) and now considering 4767/4779 (removed 12) transitions.
// Phase 1: matrix 4767 rows 3930 cols
[2023-03-12 11:04:41] [INFO ] Computed 422 place invariants in 136 ms
[2023-03-12 11:04:44] [INFO ] Implicit Places using invariants in 2995 ms returned []
[2023-03-12 11:04:44] [INFO ] Invariant cache hit.
[2023-03-12 11:04:53] [INFO ] Implicit Places using invariants and state equation in 9247 ms returned []
Implicit Place search using SMT with State Equation took 12295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 3930/4410 places, 4767/5405 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62881 ms. Remains : 3930/4410 places, 4767/5405 transitions.
Support contains 34 out of 3930 places after structural reductions.
[2023-03-12 11:04:54] [INFO ] Flatten gal took : 475 ms
[2023-03-12 11:04:55] [INFO ] Flatten gal took : 394 ms
[2023-03-12 11:04:56] [INFO ] Input system was already deterministic with 4767 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 11:04:57] [INFO ] Invariant cache hit.
[2023-03-12 11:04:58] [INFO ] [Real]Absence check using 101 positive place invariants in 156 ms returned sat
[2023-03-12 11:04:59] [INFO ] [Real]Absence check using 101 positive and 321 generalized place invariants in 414 ms returned sat
[2023-03-12 11:05:03] [INFO ] After 6911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 11:05:05] [INFO ] [Nat]Absence check using 101 positive place invariants in 87 ms returned sat
[2023-03-12 11:05:05] [INFO ] [Nat]Absence check using 101 positive and 321 generalized place invariants in 472 ms returned sat
[2023-03-12 11:05:27] [INFO ] After 20524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 11:05:28] [INFO ] Deduced a trap composed of 49 places in 1093 ms of which 7 ms to minimize.
[2023-03-12 11:05:30] [INFO ] Deduced a trap composed of 68 places in 1896 ms of which 2 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.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-12 11:05:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 11:05:30] [INFO ] After 26939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 3079 ms.
Support contains 18 out of 3930 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Drop transitions removed 724 transitions
Trivial Post-agglo rules discarded 724 transitions
Performed 724 trivial Post agglomeration. Transition count delta: 724
Iterating post reduction 0 with 724 rules applied. Total rules applied 724 place count 3930 transition count 4043
Reduce places removed 724 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 727 rules applied. Total rules applied 1451 place count 3206 transition count 4040
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 1457 place count 3204 transition count 4036
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1461 place count 3200 transition count 4036
Performed 1056 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1056 Pre rules applied. Total rules applied 1461 place count 3200 transition count 2980
Deduced a syphon composed of 1056 places in 8 ms
Ensure Unique test removed 100 places
Reduce places removed 1156 places and 0 transitions.
Iterating global reduction 4 with 2212 rules applied. Total rules applied 3673 place count 2044 transition count 2980
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 74 rules applied. Total rules applied 3747 place count 2033 transition count 2917
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 64 rules applied. Total rules applied 3811 place count 1970 transition count 2916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3812 place count 1969 transition count 2916
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 38 Pre rules applied. Total rules applied 3812 place count 1969 transition count 2878
Deduced a syphon composed of 38 places in 9 ms
Ensure Unique test removed 38 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 3926 place count 1893 transition count 2878
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 37 Pre rules applied. Total rules applied 3926 place count 1893 transition count 2841
Deduced a syphon composed of 37 places in 9 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 4000 place count 1856 transition count 2841
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4001 place count 1855 transition count 2840
Iterating global reduction 7 with 1 rules applied. Total rules applied 4002 place count 1855 transition count 2840
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 9 ms
Ensure Unique test removed 4 places
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 7 with 636 rules applied. Total rules applied 4638 place count 1535 transition count 2524
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4642 place count 1531 transition count 2520
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 4647 place count 1530 transition count 2520
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 1 rules applied. Total rules applied 4648 place count 1530 transition count 2519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4649 place count 1529 transition count 2519
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4649 place count 1529 transition count 2518
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 4651 place count 1528 transition count 2518
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 4653 place count 1526 transition count 2516
Iterating global reduction 9 with 2 rules applied. Total rules applied 4655 place count 1526 transition count 2516
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 9 with 2 rules applied. Total rules applied 4657 place count 1526 transition count 2514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4658 place count 1525 transition count 2514
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 11 with 2 rules applied. Total rules applied 4660 place count 1524 transition count 2519
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 4672 place count 1524 transition count 2507
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 4684 place count 1512 transition count 2507
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 4693 place count 1512 transition count 2498
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4702 place count 1503 transition count 2498
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 4712 place count 1503 transition count 2498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4713 place count 1502 transition count 2497
Reduce places removed 19 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 13 with 28 rules applied. Total rules applied 4741 place count 1483 transition count 2488
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 4750 place count 1474 transition count 2488
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 28 Pre rules applied. Total rules applied 4750 place count 1474 transition count 2460
Deduced a syphon composed of 28 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 15 with 57 rules applied. Total rules applied 4807 place count 1445 transition count 2460
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 15 with 11 rules applied. Total rules applied 4818 place count 1434 transition count 2460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 4818 place count 1434 transition count 2459
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 4820 place count 1433 transition count 2459
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 16 with 40 rules applied. Total rules applied 4860 place count 1413 transition count 2439
Discarding 9 places :
Symmetric choice reduction at 16 with 9 rule applications. Total rules 4869 place count 1404 transition count 2430
Iterating global reduction 16 with 9 rules applied. Total rules applied 4878 place count 1404 transition count 2430
Free-agglomeration rule applied 10 times.
Iterating global reduction 16 with 10 rules applied. Total rules applied 4888 place count 1404 transition count 2420
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 4898 place count 1394 transition count 2420
Applied a total of 4898 rules in 1958 ms. Remains 1394 /3930 variables (removed 2536) and now considering 2420/4767 (removed 2347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1971 ms. Remains : 1394/3930 places, 2420/4767 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 84946 steps, run timeout after 3005 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84946 steps, saw 21040 distinct states, run finished after 3009 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2420 rows 1394 cols
[2023-03-12 11:05:39] [INFO ] Computed 237 place invariants in 36 ms
[2023-03-12 11:05:40] [INFO ] [Real]Absence check using 66 positive place invariants in 34 ms returned sat
[2023-03-12 11:05:40] [INFO ] [Real]Absence check using 66 positive and 171 generalized place invariants in 76 ms returned sat
[2023-03-12 11:05:40] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 11:05:41] [INFO ] [Nat]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-12 11:05:41] [INFO ] [Nat]Absence check using 66 positive and 171 generalized place invariants in 74 ms returned sat
[2023-03-12 11:06:05] [INFO ] After 24198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 11:06:05] [INFO ] After 24204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 11:06:05] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 712 ms.
Support contains 18 out of 1394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1394/1394 places, 2420/2420 transitions.
Applied a total of 0 rules in 61 ms. Remains 1394 /1394 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1394/1394 places, 2420/2420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1394/1394 places, 2420/2420 transitions.
Applied a total of 0 rules in 67 ms. Remains 1394 /1394 variables (removed 0) and now considering 2420/2420 (removed 0) transitions.
[2023-03-12 11:06:06] [INFO ] Invariant cache hit.
[2023-03-12 11:06:09] [INFO ] Implicit Places using invariants in 2800 ms returned [1, 18, 19, 31, 50, 68, 140, 144, 153, 154, 156, 175, 193, 231, 265, 269, 270, 281, 282, 284, 301, 319, 388, 392, 393, 404, 405, 407, 425, 444, 513, 517, 518, 529, 530, 532, 549, 567, 636, 640, 641, 652, 653, 655, 672, 690, 765, 780, 781, 783, 800, 818, 887, 891, 892, 903, 904, 906, 923, 941, 981, 1015, 1019, 1020, 1031, 1032, 1034, 1051, 1069, 1139, 1143, 1144, 1155, 1156, 1158, 1175, 1193, 1255, 1256, 1267, 1271, 1272, 1275, 1286, 1287, 1288, 1311, 1332, 1333, 1334, 1335]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 2803 ms to find 91 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1303/1394 places, 2420/2420 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 1303 transition count 2254
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 179 rules applied. Total rules applied 345 place count 1137 transition count 2241
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 350 place count 1132 transition count 2241
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 350 place count 1132 transition count 2194
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 445 place count 1084 transition count 2194
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 456 place count 1080 transition count 2187
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 463 place count 1073 transition count 2187
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 466 place count 1070 transition count 2184
Iterating global reduction 5 with 3 rules applied. Total rules applied 469 place count 1070 transition count 2184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 471 place count 1070 transition count 2182
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 6 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 605 place count 1003 transition count 2115
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 613 place count 995 transition count 2107
Iterating global reduction 6 with 8 rules applied. Total rules applied 621 place count 995 transition count 2107
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 629 place count 995 transition count 2099
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 633 place count 993 transition count 2100
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 634 place count 993 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 635 place count 992 transition count 2099
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 992 transition count 2098
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 660 place count 992 transition count 2074
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 685 place count 967 transition count 2074
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 687 place count 967 transition count 2072
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 717 place count 967 transition count 2072
Applied a total of 717 rules in 489 ms. Remains 967 /1303 variables (removed 336) and now considering 2072/2420 (removed 348) transitions.
// Phase 1: matrix 2072 rows 967 cols
[2023-03-12 11:06:09] [INFO ] Computed 140 place invariants in 16 ms
[2023-03-12 11:06:10] [INFO ] Implicit Places using invariants in 694 ms returned [75, 91, 98, 101, 103, 107, 108, 163, 181, 187, 190, 192, 197, 198, 251, 267, 273, 276, 278, 283, 284, 339, 355, 361, 364, 366, 371, 372, 425, 441, 447, 450, 452, 457, 458, 527, 533, 536, 538, 541, 549, 550, 604, 620, 626, 629, 631, 636, 637, 690, 709, 715, 718, 720, 725, 726, 796, 802, 805, 807, 813, 814, 867, 883, 894, 897]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 715 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 901/1394 places, 2072/2420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 901 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 900 transition count 2071
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 30 place count 872 transition count 2043
Iterating global reduction 2 with 28 rules applied. Total rules applied 58 place count 872 transition count 2043
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 863 transition count 2034
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 863 transition count 2034
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 2 with 36 rules applied. Total rules applied 112 place count 845 transition count 2016
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 845 transition count 2015
Free-agglomeration rule applied 28 times.
Iterating global reduction 2 with 28 rules applied. Total rules applied 141 place count 845 transition count 1987
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 169 place count 817 transition count 1987
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 177 place count 817 transition count 1979
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 185 place count 809 transition count 1979
Applied a total of 185 rules in 316 ms. Remains 809 /901 variables (removed 92) and now considering 1979/2072 (removed 93) transitions.
// Phase 1: matrix 1979 rows 809 cols
[2023-03-12 11:06:10] [INFO ] Computed 74 place invariants in 27 ms
[2023-03-12 11:06:11] [INFO ] Implicit Places using invariants in 621 ms returned []
[2023-03-12 11:06:11] [INFO ] Invariant cache hit.
[2023-03-12 11:06:15] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 4329 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 809/1394 places, 1979/2420 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8719 ms. Remains : 809/1394 places, 1979/2420 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 102779 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{4=1}
Probabilistic random walk after 102779 steps, saw 60105 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :1
Running SMT prover for 9 properties.
[2023-03-12 11:06:18] [INFO ] Invariant cache hit.
[2023-03-12 11:06:19] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:06:19] [INFO ] [Real]Absence check using 16 positive and 58 generalized place invariants in 23 ms returned sat
[2023-03-12 11:06:21] [INFO ] After 2221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 11:06:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-12 11:06:21] [INFO ] [Nat]Absence check using 16 positive and 58 generalized place invariants in 88 ms returned sat
[2023-03-12 11:06:46] [INFO ] After 24519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 11:06:46] [INFO ] After 24533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 11:06:46] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 17 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 1979/1979 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 809 transition count 1978
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 808 transition count 1978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 807 transition count 1977
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 807 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 807 transition count 1976
Applied a total of 5 rules in 64 ms. Remains 807 /809 variables (removed 2) and now considering 1976/1979 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 807/809 places, 1976/1979 transitions.
Computed a total of 161 stabilizing places and 161 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(F(p0)))'
Support contains 2 out of 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3928 transition count 4758
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3928 transition count 4758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3926 transition count 4749
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3921 transition count 4723
Applied a total of 18 rules in 2581 ms. Remains 3921 /3930 variables (removed 9) and now considering 4723/4767 (removed 44) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2023-03-12 11:06:49] [INFO ] Computed 422 place invariants in 69 ms
[2023-03-12 11:06:53] [INFO ] Implicit Places using invariants in 3880 ms returned []
[2023-03-12 11:06:53] [INFO ] Invariant cache hit.
[2023-03-12 11:06:58] [INFO ] Implicit Places using invariants and state equation in 5778 ms returned []
Implicit Place search using SMT with State Equation took 9682 ms to find 0 implicit places.
[2023-03-12 11:06:58] [INFO ] Invariant cache hit.
[2023-03-12 11:07:01] [INFO ] Dead Transitions using invariants and state equation in 2836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3921/3930 places, 4723/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15100 ms. Remains : 3921/3930 places, 4723/4767 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-02 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 s1216 0) (EQ s374 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 1376 steps with 0 reset in 31 ms.
FORMULA ASLink-PT-10b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-02 finished in 15585 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((p0||X(p1))))'
Support contains 4 out of 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3928 transition count 4758
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3928 transition count 4758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3926 transition count 4749
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3921 transition count 4723
Applied a total of 18 rules in 2687 ms. Remains 3921 /3930 variables (removed 9) and now considering 4723/4767 (removed 44) transitions.
[2023-03-12 11:07:04] [INFO ] Invariant cache hit.
[2023-03-12 11:07:08] [INFO ] Implicit Places using invariants in 3306 ms returned []
[2023-03-12 11:07:08] [INFO ] Invariant cache hit.
[2023-03-12 11:07:11] [INFO ] Implicit Places using invariants and state equation in 3532 ms returned []
Implicit Place search using SMT with State Equation took 6855 ms to find 0 implicit places.
[2023-03-12 11:07:11] [INFO ] Invariant cache hit.
[2023-03-12 11:07:15] [INFO ] Dead Transitions using invariants and state equation in 4010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3921/3930 places, 4723/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13559 ms. Remains : 3921/3930 places, 4723/4767 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s375 0) (EQ s2147 1)), p1:(AND (EQ s2192 0) (EQ s1195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-04 finished in 13843 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 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3928 transition count 4758
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3928 transition count 4758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3926 transition count 4749
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3921 transition count 4723
Applied a total of 18 rules in 2560 ms. Remains 3921 /3930 variables (removed 9) and now considering 4723/4767 (removed 44) transitions.
[2023-03-12 11:07:18] [INFO ] Invariant cache hit.
[2023-03-12 11:07:20] [INFO ] Implicit Places using invariants in 1529 ms returned []
[2023-03-12 11:07:20] [INFO ] Invariant cache hit.
[2023-03-12 11:07:24] [INFO ] Implicit Places using invariants and state equation in 4193 ms returned []
Implicit Place search using SMT with State Equation took 5739 ms to find 0 implicit places.
[2023-03-12 11:07:24] [INFO ] Invariant cache hit.
[2023-03-12 11:07:28] [INFO ] Dead Transitions using invariants and state equation in 4033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3921/3930 places, 4723/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12367 ms. Remains : 3921/3930 places, 4723/4767 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-06 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 s895 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 1595 ms.
Product exploration explored 100000 steps with 33333 reset in 1477 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 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 109 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-10b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10b-LTLCardinality-06 finished in 15825 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(G(p0))&&F(p1))))'
Support contains 4 out of 3930 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 731 transitions
Trivial Post-agglo rules discarded 731 transitions
Performed 731 trivial Post agglomeration. Transition count delta: 731
Iterating post reduction 0 with 731 rules applied. Total rules applied 731 place count 3929 transition count 4035
Reduce places removed 731 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 734 rules applied. Total rules applied 1465 place count 3198 transition count 4032
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1468 place count 3196 transition count 4031
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 3195 transition count 4031
Performed 1065 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1065 Pre rules applied. Total rules applied 1469 place count 3195 transition count 2966
Deduced a syphon composed of 1065 places in 8 ms
Ensure Unique test removed 103 places
Reduce places removed 1168 places and 0 transitions.
Iterating global reduction 4 with 2233 rules applied. Total rules applied 3702 place count 2027 transition count 2966
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3776 place count 2017 transition count 2902
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3840 place count 1953 transition count 2902
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3840 place count 1953 transition count 2862
Deduced a syphon composed of 40 places in 9 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3960 place count 1873 transition count 2862
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3960 place count 1873 transition count 2823
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4038 place count 1834 transition count 2823
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4040 place count 1832 transition count 2814
Iterating global reduction 6 with 2 rules applied. Total rules applied 4042 place count 1832 transition count 2814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4043 place count 1831 transition count 2806
Iterating global reduction 6 with 1 rules applied. Total rules applied 4044 place count 1831 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4045 place count 1830 transition count 2798
Iterating global reduction 6 with 1 rules applied. Total rules applied 4046 place count 1830 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4047 place count 1829 transition count 2790
Iterating global reduction 6 with 1 rules applied. Total rules applied 4048 place count 1829 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4049 place count 1828 transition count 2782
Iterating global reduction 6 with 1 rules applied. Total rules applied 4050 place count 1828 transition count 2782
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 5 ms
Ensure Unique test removed 3 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 6 with 625 rules applied. Total rules applied 4675 place count 1514 transition count 2471
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4679 place count 1510 transition count 2467
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4684 place count 1509 transition count 2467
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 4685 place count 1509 transition count 2466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4686 place count 1508 transition count 2466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4686 place count 1508 transition count 2465
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4688 place count 1507 transition count 2465
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4690 place count 1505 transition count 2463
Iterating global reduction 8 with 2 rules applied. Total rules applied 4692 place count 1505 transition count 2463
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 4694 place count 1505 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4695 place count 1504 transition count 2461
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 10 with 2 rules applied. Total rules applied 4697 place count 1503 transition count 2466
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4699 place count 1501 transition count 2464
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4729 place count 1481 transition count 2454
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4739 place count 1471 transition count 2454
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4739 place count 1471 transition count 2424
Deduced a syphon composed of 30 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4800 place count 1440 transition count 2424
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4821 place count 1419 transition count 2424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4821 place count 1419 transition count 2423
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4823 place count 1418 transition count 2423
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4885 place count 1387 transition count 2392
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 4905 place count 1367 transition count 2372
Iterating global reduction 13 with 20 rules applied. Total rules applied 4925 place count 1367 transition count 2372
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4935 place count 1357 transition count 2362
Iterating global reduction 13 with 10 rules applied. Total rules applied 4945 place count 1357 transition count 2362
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4955 place count 1357 transition count 2352
Applied a total of 4955 rules in 1310 ms. Remains 1357 /3930 variables (removed 2573) and now considering 2352/4767 (removed 2415) transitions.
// Phase 1: matrix 2352 rows 1357 cols
[2023-03-12 11:07:33] [INFO ] Computed 223 place invariants in 56 ms
[2023-03-12 11:07:34] [INFO ] Implicit Places using invariants in 1110 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 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, 958, 993, 994, 1006, 1007, 1009, 1026, 1044, 1064, 1115, 1116, 1128, 1129, 1131, 1148, 1166, 1186, 1237, 1238, 1241, 1252, 1253, 1254, 1272, 1293, 1294, 1295, 1296]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1114 ms to find 90 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1267/3930 places, 2352/4767 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1267 transition count 2191
Reduce places removed 161 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 323 place count 1106 transition count 2190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 1105 transition count 2190
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 324 place count 1105 transition count 2143
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 419 place count 1057 transition count 2143
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 431 place count 1053 transition count 2135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 439 place count 1045 transition count 2135
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 442 place count 1042 transition count 2132
Iterating global reduction 5 with 3 rules applied. Total rules applied 445 place count 1042 transition count 2132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 448 place count 1042 transition count 2129
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 4 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 600 place count 966 transition count 2053
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 604 place count 964 transition count 2054
Applied a total of 604 rules in 198 ms. Remains 964 /1267 variables (removed 303) and now considering 2054/2352 (removed 298) transitions.
// Phase 1: matrix 2054 rows 964 cols
[2023-03-12 11:07:34] [INFO ] Computed 128 place invariants in 15 ms
[2023-03-12 11:07:35] [INFO ] Implicit Places using invariants in 978 ms returned [88, 94, 99, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 706, 712, 717, 794, 800, 805, 882, 888, 893, 961]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 981 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 933/3930 places, 2054/4767 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 933 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 932 transition count 2053
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 912 transition count 2033
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 912 transition count 2033
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 892 transition count 2013
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 892 transition count 2013
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 882 transition count 2003
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 882 transition count 2003
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 872 transition count 1993
Applied a total of 122 rules in 222 ms. Remains 872 /933 variables (removed 61) and now considering 1993/2054 (removed 61) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2023-03-12 11:07:35] [INFO ] Computed 97 place invariants in 24 ms
[2023-03-12 11:07:36] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-12 11:07:36] [INFO ] Invariant cache hit.
[2023-03-12 11:07:40] [INFO ] Implicit Places using invariants and state equation in 4680 ms returned []
Implicit Place search using SMT with State Equation took 5399 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 872/3930 places, 1993/4767 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9224 ms. Remains : 872/3930 places, 1993/4767 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-07 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s115 0) (EQ s635 1)), p1:(OR (AND (EQ s635 0) (EQ s115 1)) (EQ s858 0) (EQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1118 reset in 354 ms.
Product exploration explored 100000 steps with 1152 reset in 440 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 107 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:07:42] [INFO ] Invariant cache hit.
[2023-03-12 11:07:42] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:07:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2023-03-12 11:07:43] [INFO ] [Nat]Absence check using 15 positive and 82 generalized place invariants in 107 ms returned sat
[2023-03-12 11:07:44] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:07:44] [INFO ] After 1233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 11:07:44] [INFO ] After 1602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 872 transition count 1991
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 870 transition count 1991
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 869 transition count 1990
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 869 transition count 1940
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 116 place count 819 transition count 1930
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 145 place count 819 transition count 1901
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 174 place count 790 transition count 1901
Applied a total of 174 rules in 150 ms. Remains 790 /872 variables (removed 82) and now considering 1901/1993 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 790/872 places, 1901/1993 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249845 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249845 steps, saw 68589 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1901 rows 790 cols
[2023-03-12 11:07:47] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-12 11:07:47] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:07:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 11:07:48] [INFO ] [Nat]Absence check using 15 positive and 82 generalized place invariants in 54 ms returned sat
[2023-03-12 11:07:48] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:07:49] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-12 11:07:49] [INFO ] After 1238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 31 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 790/790 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 30 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-12 11:07:49] [INFO ] Invariant cache hit.
[2023-03-12 11:07:49] [INFO ] Implicit Places using invariants in 632 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 589, 590, 660, 661]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 639 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 772/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 31 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 700 ms. Remains : 772/790 places, 1901/1901 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262372 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262372 steps, saw 72292 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1901 rows 772 cols
[2023-03-12 11:07:53] [INFO ] Computed 79 place invariants in 37 ms
[2023-03-12 11:07:53] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:07:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 63 ms returned sat
[2023-03-12 11:07:53] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 197 ms returned sat
[2023-03-12 11:07:54] [INFO ] After 1164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:07:54] [INFO ] After 1332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 11:07:55] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 70 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 772/772 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 66 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-12 11:07:55] [INFO ] Invariant cache hit.
[2023-03-12 11:07:55] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-12 11:07:55] [INFO ] Invariant cache hit.
[2023-03-12 11:08:00] [INFO ] Implicit Places using invariants and state equation in 4126 ms returned []
Implicit Place search using SMT with State Equation took 4848 ms to find 0 implicit places.
[2023-03-12 11:08:00] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-12 11:08:00] [INFO ] Invariant cache hit.
[2023-03-12 11:08:01] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5955 ms. Remains : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 28 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 11:08:01] [INFO ] Invariant cache hit.
[2023-03-12 11:08:01] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:08:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-12 11:08:01] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 20 ms returned sat
[2023-03-12 11:08:02] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:08:02] [INFO ] After 1443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 11:08:02] [INFO ] After 1720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Applied a total of 0 rules in 59 ms. Remains 872 /872 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2023-03-12 11:08:03] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-12 11:08:04] [INFO ] Implicit Places using invariants in 835 ms returned []
[2023-03-12 11:08:04] [INFO ] Invariant cache hit.
[2023-03-12 11:08:08] [INFO ] Implicit Places using invariants and state equation in 3411 ms returned []
Implicit Place search using SMT with State Equation took 4249 ms to find 0 implicit places.
[2023-03-12 11:08:08] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-12 11:08:08] [INFO ] Invariant cache hit.
[2023-03-12 11:08:09] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5413 ms. Remains : 872/872 places, 1993/1993 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:08:09] [INFO ] Invariant cache hit.
[2023-03-12 11:08:09] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:08:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 11:08:10] [INFO ] [Nat]Absence check using 15 positive and 82 generalized place invariants in 189 ms returned sat
[2023-03-12 11:08:11] [INFO ] After 1297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:08:11] [INFO ] After 1503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-12 11:08:11] [INFO ] After 2010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 872 transition count 1991
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 870 transition count 1991
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 869 transition count 1990
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 869 transition count 1940
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 116 place count 819 transition count 1930
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 145 place count 819 transition count 1901
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 174 place count 790 transition count 1901
Applied a total of 174 rules in 121 ms. Remains 790 /872 variables (removed 82) and now considering 1901/1993 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 790/872 places, 1901/1993 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253974 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253974 steps, saw 69609 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1901 rows 790 cols
[2023-03-12 11:08:15] [INFO ] Computed 97 place invariants in 29 ms
[2023-03-12 11:08:15] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:08:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 11:08:15] [INFO ] [Nat]Absence check using 15 positive and 82 generalized place invariants in 116 ms returned sat
[2023-03-12 11:08:16] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:08:16] [INFO ] After 1023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 11:08:16] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 54 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 790/790 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 34 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-12 11:08:16] [INFO ] Invariant cache hit.
[2023-03-12 11:08:18] [INFO ] Implicit Places using invariants in 1231 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 589, 590, 660, 661]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1233 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 772/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 29 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1296 ms. Remains : 772/790 places, 1901/1901 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269708 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269708 steps, saw 74320 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1901 rows 772 cols
[2023-03-12 11:08:21] [INFO ] Computed 79 place invariants in 14 ms
[2023-03-12 11:08:21] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:08:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:08:21] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 57 ms returned sat
[2023-03-12 11:08:23] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:08:23] [INFO ] After 1558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-12 11:08:23] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 56 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 772/772 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 32 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-12 11:08:23] [INFO ] Invariant cache hit.
[2023-03-12 11:08:24] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-12 11:08:24] [INFO ] Invariant cache hit.
[2023-03-12 11:08:27] [INFO ] Implicit Places using invariants and state equation in 2936 ms returned []
Implicit Place search using SMT with State Equation took 4367 ms to find 0 implicit places.
[2023-03-12 11:08:27] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-12 11:08:27] [INFO ] Invariant cache hit.
[2023-03-12 11:08:28] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5466 ms. Remains : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 30 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 11:08:28] [INFO ] Invariant cache hit.
[2023-03-12 11:08:28] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 11:08:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:08:29] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 32 ms returned sat
[2023-03-12 11:08:30] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:08:30] [INFO ] After 976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-12 11:08:30] [INFO ] After 1280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 380 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1137 reset in 316 ms.
Product exploration explored 100000 steps with 1155 reset in 328 ms.
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Applied a total of 0 rules in 32 ms. Remains 872 /872 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2023-03-12 11:08:32] [INFO ] Computed 97 place invariants in 39 ms
[2023-03-12 11:08:32] [INFO ] Implicit Places using invariants in 743 ms returned []
[2023-03-12 11:08:32] [INFO ] Invariant cache hit.
[2023-03-12 11:08:35] [INFO ] Implicit Places using invariants and state equation in 3070 ms returned []
Implicit Place search using SMT with State Equation took 3845 ms to find 0 implicit places.
[2023-03-12 11:08:35] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 11:08:35] [INFO ] Invariant cache hit.
[2023-03-12 11:08:36] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4791 ms. Remains : 872/872 places, 1993/1993 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-07 finished in 65314 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 3 out of 3930 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 733 rules applied. Total rules applied 733 place count 3929 transition count 4033
Reduce places removed 733 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 736 rules applied. Total rules applied 1469 place count 3196 transition count 4030
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1472 place count 3194 transition count 4029
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1473 place count 3193 transition count 4029
Performed 1065 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1065 Pre rules applied. Total rules applied 1473 place count 3193 transition count 2964
Deduced a syphon composed of 1065 places in 10 ms
Ensure Unique test removed 104 places
Reduce places removed 1169 places and 0 transitions.
Iterating global reduction 4 with 2234 rules applied. Total rules applied 3707 place count 2024 transition count 2964
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3781 place count 2014 transition count 2900
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3845 place count 1950 transition count 2900
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 3845 place count 1950 transition count 2859
Deduced a syphon composed of 41 places in 10 ms
Ensure Unique test removed 40 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 3967 place count 1869 transition count 2859
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3967 place count 1869 transition count 2820
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4045 place count 1830 transition count 2820
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4047 place count 1828 transition count 2811
Iterating global reduction 6 with 2 rules applied. Total rules applied 4049 place count 1828 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4050 place count 1827 transition count 2803
Iterating global reduction 6 with 1 rules applied. Total rules applied 4051 place count 1827 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4052 place count 1826 transition count 2795
Iterating global reduction 6 with 1 rules applied. Total rules applied 4053 place count 1826 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4054 place count 1825 transition count 2787
Iterating global reduction 6 with 1 rules applied. Total rules applied 4055 place count 1825 transition count 2787
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 6 with 624 rules applied. Total rules applied 4679 place count 1512 transition count 2476
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4683 place count 1508 transition count 2472
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4688 place count 1507 transition count 2472
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 4689 place count 1507 transition count 2471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4690 place count 1506 transition count 2471
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4690 place count 1506 transition count 2470
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4692 place count 1505 transition count 2470
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4694 place count 1503 transition count 2468
Iterating global reduction 8 with 2 rules applied. Total rules applied 4696 place count 1503 transition count 2468
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 4698 place count 1503 transition count 2466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4699 place count 1502 transition count 2466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4701 place count 1501 transition count 2471
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4703 place count 1499 transition count 2469
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4733 place count 1479 transition count 2459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4743 place count 1469 transition count 2459
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4743 place count 1469 transition count 2429
Deduced a syphon composed of 30 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4804 place count 1438 transition count 2429
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4825 place count 1417 transition count 2429
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4825 place count 1417 transition count 2428
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4827 place count 1416 transition count 2428
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4889 place count 1385 transition count 2397
Discarding 19 places :
Symmetric choice reduction at 13 with 19 rule applications. Total rules 4908 place count 1366 transition count 2378
Iterating global reduction 13 with 19 rules applied. Total rules applied 4927 place count 1366 transition count 2378
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 4936 place count 1357 transition count 2369
Iterating global reduction 13 with 9 rules applied. Total rules applied 4945 place count 1357 transition count 2369
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 4954 place count 1357 transition count 2360
Applied a total of 4954 rules in 1336 ms. Remains 1357 /3930 variables (removed 2573) and now considering 2360/4767 (removed 2407) transitions.
// Phase 1: matrix 2360 rows 1357 cols
[2023-03-12 11:08:38] [INFO ] Computed 223 place invariants in 21 ms
[2023-03-12 11:08:40] [INFO ] Implicit Places using invariants in 1917 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 815, 866, 867, 879, 880, 882, 899, 917, 937, 988, 989, 1001, 1002, 1004, 1021, 1039, 1108, 1116, 1117, 1129, 1130, 1132, 1149, 1167, 1187, 1238, 1239, 1242, 1253, 1254, 1255, 1274, 1295, 1296, 1297, 1298]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1922 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1268/3930 places, 2360/4767 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1268 transition count 2197
Reduce places removed 163 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 164 rules applied. Total rules applied 327 place count 1105 transition count 2196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 1104 transition count 2196
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 328 place count 1104 transition count 2149
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 423 place count 1056 transition count 2149
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 431 place count 1052 transition count 2145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 435 place count 1048 transition count 2145
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 438 place count 1045 transition count 2142
Iterating global reduction 5 with 3 rules applied. Total rules applied 441 place count 1045 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 444 place count 1042 transition count 2139
Iterating global reduction 5 with 3 rules applied. Total rules applied 447 place count 1042 transition count 2139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 450 place count 1042 transition count 2136
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 5 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 598 place count 968 transition count 2062
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 602 place count 966 transition count 2063
Applied a total of 602 rules in 244 ms. Remains 966 /1268 variables (removed 302) and now considering 2063/2360 (removed 297) transitions.
// Phase 1: matrix 2063 rows 966 cols
[2023-03-12 11:08:40] [INFO ] Computed 129 place invariants in 24 ms
[2023-03-12 11:08:41] [INFO ] Implicit Places using invariants in 1207 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 614, 620, 625, 702, 708, 713, 793, 799, 884, 890, 895, 962]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1211 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 936/3930 places, 2063/4767 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 936 transition count 2062
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 935 transition count 2062
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 916 transition count 2043
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 916 transition count 2043
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 897 transition count 2024
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 897 transition count 2024
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 887 transition count 2014
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 887 transition count 2014
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 118 place count 877 transition count 2004
Applied a total of 118 rules in 148 ms. Remains 877 /936 variables (removed 59) and now considering 2004/2063 (removed 59) transitions.
// Phase 1: matrix 2004 rows 877 cols
[2023-03-12 11:08:41] [INFO ] Computed 99 place invariants in 15 ms
[2023-03-12 11:08:42] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-12 11:08:42] [INFO ] Invariant cache hit.
[2023-03-12 11:08:45] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3343 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 877/3930 places, 2004/4767 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8205 ms. Remains : 877/3930 places, 2004/4767 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-08 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:(OR (EQ s837 0) (EQ s728 1)), p1:(EQ s703 0)], 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 2303 steps with 31 reset in 7 ms.
FORMULA ASLink-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-08 finished in 8439 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((X(G(p0))&&G(p1))))'
Support contains 6 out of 3930 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 732 transitions
Trivial Post-agglo rules discarded 732 transitions
Performed 732 trivial Post agglomeration. Transition count delta: 732
Iterating post reduction 0 with 732 rules applied. Total rules applied 732 place count 3929 transition count 4034
Reduce places removed 732 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 735 rules applied. Total rules applied 1467 place count 3197 transition count 4031
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 1471 place count 3195 transition count 4029
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1473 place count 3193 transition count 4029
Performed 1064 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1064 Pre rules applied. Total rules applied 1473 place count 3193 transition count 2965
Deduced a syphon composed of 1064 places in 11 ms
Ensure Unique test removed 103 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 4 with 2231 rules applied. Total rules applied 3704 place count 2026 transition count 2965
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3778 place count 2016 transition count 2901
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3842 place count 1952 transition count 2901
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3842 place count 1952 transition count 2861
Deduced a syphon composed of 40 places in 10 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3962 place count 1872 transition count 2861
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3962 place count 1872 transition count 2822
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4040 place count 1833 transition count 2822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4041 place count 1832 transition count 2821
Iterating global reduction 6 with 1 rules applied. Total rules applied 4042 place count 1832 transition count 2821
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 6 with 622 rules applied. Total rules applied 4664 place count 1520 transition count 2511
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4668 place count 1516 transition count 2507
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4673 place count 1515 transition count 2507
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 4674 place count 1515 transition count 2506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4675 place count 1514 transition count 2506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4675 place count 1514 transition count 2505
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 4677 place count 1513 transition count 2505
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4679 place count 1511 transition count 2503
Iterating global reduction 8 with 2 rules applied. Total rules applied 4681 place count 1511 transition count 2503
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 4683 place count 1511 transition count 2501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4684 place count 1510 transition count 2501
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 10 with 2 rules applied. Total rules applied 4686 place count 1509 transition count 2506
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4688 place count 1507 transition count 2504
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4718 place count 1487 transition count 2494
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4728 place count 1477 transition count 2494
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4728 place count 1477 transition count 2464
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4789 place count 1446 transition count 2464
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4810 place count 1425 transition count 2464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4810 place count 1425 transition count 2463
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4812 place count 1424 transition count 2463
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4874 place count 1393 transition count 2432
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 4894 place count 1373 transition count 2412
Iterating global reduction 13 with 20 rules applied. Total rules applied 4914 place count 1373 transition count 2412
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4924 place count 1363 transition count 2402
Iterating global reduction 13 with 10 rules applied. Total rules applied 4934 place count 1363 transition count 2402
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4944 place count 1363 transition count 2392
Applied a total of 4944 rules in 1225 ms. Remains 1363 /3930 variables (removed 2567) and now considering 2392/4767 (removed 2375) transitions.
// Phase 1: matrix 2392 rows 1363 cols
[2023-03-12 11:08:46] [INFO ] Computed 224 place invariants in 41 ms
[2023-03-12 11:08:48] [INFO ] Implicit Places using invariants in 1445 ms returned [1, 18, 19, 31, 50, 68, 88, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 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, 1125, 1126, 1128, 1145, 1163, 1183, 1226, 1227, 1239, 1240, 1243, 1254, 1255, 1256, 1279, 1300, 1301, 1302, 1303]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 1461 ms to find 91 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1272/3930 places, 2392/4767 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1272 transition count 2230
Reduce places removed 162 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 326 place count 1110 transition count 2228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 328 place count 1108 transition count 2228
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 328 place count 1108 transition count 2181
Deduced a syphon composed of 47 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 423 place count 1060 transition count 2181
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 434 place count 1056 transition count 2174
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 441 place count 1049 transition count 2174
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 444 place count 1046 transition count 2171
Iterating global reduction 5 with 3 rules applied. Total rules applied 447 place count 1046 transition count 2171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 1046 transition count 2169
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 4 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 599 place count 971 transition count 2094
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 6 with 4 rules applied. Total rules applied 603 place count 969 transition count 2095
Applied a total of 603 rules in 196 ms. Remains 969 /1272 variables (removed 303) and now considering 2095/2392 (removed 297) transitions.
// Phase 1: matrix 2095 rows 969 cols
[2023-03-12 11:08:48] [INFO ] Computed 128 place invariants in 40 ms
[2023-03-12 11:08:53] [INFO ] Implicit Places using invariants in 5345 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, 880, 894, 966]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 5362 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 939/3930 places, 2095/4767 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 939 transition count 2094
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 938 transition count 2094
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 919 transition count 2075
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 919 transition count 2075
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 900 transition count 2056
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 900 transition count 2056
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 891 transition count 2047
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 891 transition count 2047
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 116 place count 881 transition count 2037
Applied a total of 116 rules in 158 ms. Remains 881 /939 variables (removed 58) and now considering 2037/2095 (removed 58) transitions.
// Phase 1: matrix 2037 rows 881 cols
[2023-03-12 11:08:53] [INFO ] Computed 98 place invariants in 32 ms
[2023-03-12 11:08:54] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-12 11:08:54] [INFO ] Invariant cache hit.
[2023-03-12 11:08:56] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 881/3930 places, 2037/4767 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 11041 ms. Remains : 881/3930 places, 2037/4767 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s60 0) (EQ s879 1) (EQ s833 0) (EQ s805 1)), p0:(AND (EQ s807 0) (EQ s28 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1079 reset in 406 ms.
Product exploration explored 100000 steps with 1038 reset in 326 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 619 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 124551 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124551 steps, saw 33665 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:09:01] [INFO ] Invariant cache hit.
[2023-03-12 11:09:02] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:09:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 11:09:02] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 33 ms returned sat
[2023-03-12 11:09:27] [INFO ] After 24716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:09:27] [INFO ] After 24718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 11:09:27] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 881 transition count 1987
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 831 transition count 1977
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 831 transition count 1976
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 140 place count 831 transition count 1947
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 169 place count 802 transition count 1947
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 802 transition count 1947
Applied a total of 170 rules in 164 ms. Remains 802 /881 variables (removed 79) and now considering 1947/2037 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 802/881 places, 1947/2037 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132395 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132395 steps, saw 30133 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1947 rows 802 cols
[2023-03-12 11:09:31] [INFO ] Computed 98 place invariants in 14 ms
[2023-03-12 11:09:31] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:09:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 11:09:31] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 35 ms returned sat
[2023-03-12 11:09:56] [INFO ] After 24619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:09:56] [INFO ] After 24624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 11:09:56] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 33 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 802/802 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 40 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2023-03-12 11:09:56] [INFO ] Invariant cache hit.
[2023-03-12 11:09:57] [INFO ] Implicit Places using invariants in 1020 ms returned [90, 91, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 587, 588, 658, 659]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 784/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 32 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1124 ms. Remains : 784/802 places, 1947/1947 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 153478 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153478 steps, saw 33821 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1947 rows 784 cols
[2023-03-12 11:10:00] [INFO ] Computed 80 place invariants in 19 ms
[2023-03-12 11:10:01] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:10:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:10:01] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 58 ms returned sat
[2023-03-12 11:10:26] [INFO ] After 24728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:10:26] [INFO ] After 24754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 11:10:26] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 30 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 784/784 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 44 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2023-03-12 11:10:26] [INFO ] Invariant cache hit.
[2023-03-12 11:10:26] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 11:10:26] [INFO ] Invariant cache hit.
[2023-03-12 11:10:28] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-12 11:10:28] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 11:10:28] [INFO ] Invariant cache hit.
[2023-03-12 11:10:29] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3717 ms. Remains : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 27 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-12 11:10:29] [INFO ] Invariant cache hit.
[2023-03-12 11:10:30] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:10:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:10:30] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 32 ms returned sat
[2023-03-12 11:10:54] [INFO ] After 23927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 11:11:12] [INFO ] After 42208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-12 11:11:12] [INFO ] After 42776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 701 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2037 rows 881 cols
[2023-03-12 11:11:14] [INFO ] Computed 98 place invariants in 15 ms
[2023-03-12 11:11:15] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-12 11:11:16] [INFO ] [Real]Absence check using 15 positive and 83 generalized place invariants in 185 ms returned sat
[2023-03-12 11:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:11:20] [INFO ] [Real]Absence check using state equation in 4791 ms returned sat
[2023-03-12 11:11:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:11:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 71 ms returned sat
[2023-03-12 11:11:22] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 196 ms returned sat
[2023-03-12 11:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:11:28] [INFO ] [Nat]Absence check using state equation in 5154 ms returned sat
[2023-03-12 11:11:28] [INFO ] Computed and/alt/rep : 611/2882/611 causal constraints (skipped 1356 transitions) in 151 ms.
[2023-03-12 11:11:34] [INFO ] Added : 214 causal constraints over 43 iterations in 6158 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Applied a total of 0 rules in 35 ms. Remains 881 /881 variables (removed 0) and now considering 2037/2037 (removed 0) transitions.
[2023-03-12 11:11:34] [INFO ] Invariant cache hit.
[2023-03-12 11:11:35] [INFO ] Implicit Places using invariants in 856 ms returned []
[2023-03-12 11:11:35] [INFO ] Invariant cache hit.
[2023-03-12 11:11:38] [INFO ] Implicit Places using invariants and state equation in 2887 ms returned []
Implicit Place search using SMT with State Equation took 3748 ms to find 0 implicit places.
[2023-03-12 11:11:38] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 11:11:38] [INFO ] Invariant cache hit.
[2023-03-12 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 1220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5066 ms. Remains : 881/881 places, 2037/2037 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 523 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 119872 steps, run timeout after 3003 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119872 steps, saw 31851 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:11:43] [INFO ] Invariant cache hit.
[2023-03-12 11:11:43] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:11:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 11:11:44] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 105 ms returned sat
[2023-03-12 11:12:04] [INFO ] After 19997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:12:08] [INFO ] After 24595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 11:12:08] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 881 transition count 1987
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 831 transition count 1977
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 831 transition count 1976
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 140 place count 831 transition count 1947
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 169 place count 802 transition count 1947
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 802 transition count 1947
Applied a total of 170 rules in 171 ms. Remains 802 /881 variables (removed 79) and now considering 1947/2037 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 802/881 places, 1947/2037 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 158155 steps, run timeout after 3006 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158155 steps, saw 34788 distinct states, run finished after 3007 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1947 rows 802 cols
[2023-03-12 11:12:12] [INFO ] Computed 98 place invariants in 14 ms
[2023-03-12 11:12:12] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:12:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 11:12:12] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 37 ms returned sat
[2023-03-12 11:12:34] [INFO ] After 21713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:12:37] [INFO ] After 24572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 11:12:37] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 46 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 802/802 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 29 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2023-03-12 11:12:37] [INFO ] Invariant cache hit.
[2023-03-12 11:12:38] [INFO ] Implicit Places using invariants in 802 ms returned [90, 91, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 587, 588, 658, 659]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 820 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 784/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 36 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 885 ms. Remains : 784/802 places, 1947/1947 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 144529 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144529 steps, saw 32405 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1947 rows 784 cols
[2023-03-12 11:12:41] [INFO ] Computed 80 place invariants in 14 ms
[2023-03-12 11:12:42] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:12:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:12:42] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 47 ms returned sat
[2023-03-12 11:13:04] [INFO ] After 22199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:13:04] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 1 ms to minimize.
[2023-03-12 11:13:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2023-03-12 11:13:06] [INFO ] After 24213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-12 11:13:07] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 6 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 43 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 784/784 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 35 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2023-03-12 11:13:07] [INFO ] Invariant cache hit.
[2023-03-12 11:13:07] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-12 11:13:07] [INFO ] Invariant cache hit.
[2023-03-12 11:13:11] [INFO ] Implicit Places using invariants and state equation in 3239 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
[2023-03-12 11:13:11] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 11:13:11] [INFO ] Invariant cache hit.
[2023-03-12 11:13:12] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5664 ms. Remains : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 30 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-12 11:13:12] [INFO ] Invariant cache hit.
[2023-03-12 11:13:13] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:13:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-12 11:13:13] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 60 ms returned sat
[2023-03-12 11:13:42] [INFO ] After 28623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 11:13:42] [INFO ] After 28828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-12 11:13:42] [INFO ] After 29228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 826 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2037 rows 881 cols
[2023-03-12 11:13:43] [INFO ] Computed 98 place invariants in 35 ms
[2023-03-12 11:13:46] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 11:13:46] [INFO ] [Real]Absence check using 15 positive and 83 generalized place invariants in 177 ms returned sat
[2023-03-12 11:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 11:13:51] [INFO ] [Real]Absence check using state equation in 4910 ms returned sat
[2023-03-12 11:13:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 11:13:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 11:13:53] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 231 ms returned sat
[2023-03-12 11:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 11:13:57] [INFO ] [Nat]Absence check using state equation in 3786 ms returned sat
[2023-03-12 11:13:57] [INFO ] Computed and/alt/rep : 611/2882/611 causal constraints (skipped 1356 transitions) in 262 ms.
[2023-03-12 11:14:03] [INFO ] Added : 214 causal constraints over 43 iterations in 6754 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1036 reset in 263 ms.
Product exploration explored 100000 steps with 1095 reset in 312 ms.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Applied a total of 0 rules in 31 ms. Remains 881 /881 variables (removed 0) and now considering 2037/2037 (removed 0) transitions.
[2023-03-12 11:14:04] [INFO ] Invariant cache hit.
[2023-03-12 11:14:05] [INFO ] Implicit Places using invariants in 687 ms returned []
[2023-03-12 11:14:05] [INFO ] Invariant cache hit.
[2023-03-12 11:14:08] [INFO ] Implicit Places using invariants and state equation in 3152 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
[2023-03-12 11:14:08] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 11:14:08] [INFO ] Invariant cache hit.
[2023-03-12 11:14:09] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5187 ms. Remains : 881/881 places, 2037/2037 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-10 finished in 324601 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((X(p0)&&(p1||F(p2))))))'
Support contains 4 out of 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3928 transition count 4758
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3928 transition count 4758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3926 transition count 4749
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3921 transition count 4723
Applied a total of 18 rules in 2486 ms. Remains 3921 /3930 variables (removed 9) and now considering 4723/4767 (removed 44) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2023-03-12 11:14:12] [INFO ] Computed 422 place invariants in 52 ms
[2023-03-12 11:14:14] [INFO ] Implicit Places using invariants in 2150 ms returned []
[2023-03-12 11:14:14] [INFO ] Invariant cache hit.
[2023-03-12 11:14:23] [INFO ] Implicit Places using invariants and state equation in 8883 ms returned []
Implicit Place search using SMT with State Equation took 11064 ms to find 0 implicit places.
[2023-03-12 11:14:23] [INFO ] Invariant cache hit.
[2023-03-12 11:14:27] [INFO ] Dead Transitions using invariants and state equation in 3988 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3921/3930 places, 4723/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17553 ms. Remains : 3921/3930 places, 4723/4767 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s2753 0) (NEQ s297 1)), p2:(OR (EQ s2732 0) (EQ s598 1)), p0:(AND (EQ s297 0) (EQ s2753 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-12 finished in 17885 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)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 6 out of 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3929 transition count 4759
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3929 transition count 4759
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3928 transition count 4751
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3928 transition count 4751
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3927 transition count 4750
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3927 transition count 4750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3926 transition count 4742
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3926 transition count 4742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4734
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4733
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4725
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4725
Applied a total of 14 rules in 2508 ms. Remains 3923 /3930 variables (removed 7) and now considering 4725/4767 (removed 42) transitions.
// Phase 1: matrix 4725 rows 3923 cols
[2023-03-12 11:14:30] [INFO ] Computed 422 place invariants in 98 ms
[2023-03-12 11:14:32] [INFO ] Implicit Places using invariants in 2485 ms returned []
[2023-03-12 11:14:33] [INFO ] Invariant cache hit.
[2023-03-12 11:14:36] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 6486 ms to find 0 implicit places.
[2023-03-12 11:14:36] [INFO ] Invariant cache hit.
[2023-03-12 11:14:41] [INFO ] Dead Transitions using invariants and state equation in 4479 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3923/3930 places, 4725/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13475 ms. Remains : 3923/3930 places, 4725/4767 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s837 0) (EQ s609 1)), p1:(OR (EQ s90 0) (EQ s2045 1)), p2:(OR (EQ s3664 0) (EQ s913 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1257 steps with 0 reset in 13 ms.
FORMULA ASLink-PT-10b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-14 finished in 13830 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(G((X(p1)&&p0)))))'
Support contains 4 out of 3930 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3930/3930 places, 4767/4767 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3928 transition count 4758
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3928 transition count 4758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 3926 transition count 4749
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3925 transition count 4748
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3924 transition count 4740
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3923 transition count 4732
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3922 transition count 4731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3921 transition count 4723
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3921 transition count 4723
Applied a total of 18 rules in 2392 ms. Remains 3921 /3930 variables (removed 9) and now considering 4723/4767 (removed 44) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2023-03-12 11:14:44] [INFO ] Computed 422 place invariants in 59 ms
[2023-03-12 11:14:48] [INFO ] Implicit Places using invariants in 3834 ms returned []
[2023-03-12 11:14:48] [INFO ] Invariant cache hit.
[2023-03-12 11:14:52] [INFO ] Implicit Places using invariants and state equation in 4023 ms returned []
Implicit Place search using SMT with State Equation took 7894 ms to find 0 implicit places.
[2023-03-12 11:14:52] [INFO ] Invariant cache hit.
[2023-03-12 11:14:55] [INFO ] Dead Transitions using invariants and state equation in 3846 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3921/3930 places, 4723/4767 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14137 ms. Remains : 3921/3930 places, 4723/4767 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (EQ s1761 0) (EQ s980 1)) (OR (EQ s1615 0) (EQ s3145 1))), p1:(OR (EQ s1761 0) (EQ s980 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4863 steps with 5 reset in 41 ms.
FORMULA ASLink-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-15 finished in 14533 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(G(p0))&&F(p1))))'
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((X(G(p0))&&G(p1))))'
[2023-03-12 11:14:56] [INFO ] Flatten gal took : 199 ms
[2023-03-12 11:14:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 11:14:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3930 places, 4767 transitions and 14725 arcs took 29 ms.
Total runtime 666998 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1441/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1441/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ASLink-PT-10b-LTLCardinality-07
Could not compute solution for formula : ASLink-PT-10b-LTLCardinality-10

BK_STOP 1678619703420

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ASLink-PT-10b-LTLCardinality-07
ltl formula formula --ltl=/tmp/1441/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3930 places, 4767 transitions and 14725 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.310 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ASLink-PT-10b-LTLCardinality-10
ltl formula formula --ltl=/tmp/1441/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3930 places, 4767 transitions and 14725 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.080 real 0.270 user 0.580 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-10b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597500163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10b.tgz
mv ASLink-PT-10b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;