Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399400411.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BugTracking-PT-q8m016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716332959517

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:09:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:09:21] [INFO ] Load time of PNML (sax parser for PT used): 914 ms
[2024-05-21 23:09:21] [INFO ] Transformed 754 places.
[2024-05-21 23:09:21] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:09:21] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 85 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 3904
Applied a total of 1 rules in 144 ms. Remains 279 /280 variables (removed 1) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 23:09:22] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 279 cols
[2024-05-21 23:09:22] [INFO ] Computed 9 invariants in 49 ms
[2024-05-21 23:09:23] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-21 23:09:23] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:09:23] [INFO ] Invariant cache hit.
[2024-05-21 23:09:23] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 23:09:26] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 23:09:26] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:09:26] [INFO ] Invariant cache hit.
[2024-05-21 23:09:26] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 23:10:31] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 19 ms to minimize.
[2024-05-21 23:10:31] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 2 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 2 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2024-05-21 23:10:32] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4008 variables, and 15 constraints, problems are : Problem set: 4 solved, 3898 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/279 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 3898 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2819 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2821 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2834 is UNSAT
Problem TDEAD2835 is UNSAT
Problem TDEAD2836 is UNSAT
Problem TDEAD2837 is UNSAT
Problem TDEAD2838 is UNSAT
Problem TDEAD2839 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2845 is UNSAT
Problem TDEAD2846 is UNSAT
Problem TDEAD2847 is UNSAT
Problem TDEAD2848 is UNSAT
Problem TDEAD2849 is UNSAT
Problem TDEAD2850 is UNSAT
Problem TDEAD2851 is UNSAT
Problem TDEAD2852 is UNSAT
Problem TDEAD2853 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2855 is UNSAT
Problem TDEAD2856 is UNSAT
Problem TDEAD2857 is UNSAT
Problem TDEAD2858 is UNSAT
Problem TDEAD2859 is UNSAT
Problem TDEAD2860 is UNSAT
Problem TDEAD2864 is UNSAT
Problem TDEAD2865 is UNSAT
Problem TDEAD2866 is UNSAT
Problem TDEAD2867 is UNSAT
Problem TDEAD2868 is UNSAT
Problem TDEAD2869 is UNSAT
Problem TDEAD2870 is UNSAT
Problem TDEAD2871 is UNSAT
Problem TDEAD2872 is UNSAT
Problem TDEAD2873 is UNSAT
Problem TDEAD2874 is UNSAT
Problem TDEAD2875 is UNSAT
Problem TDEAD2880 is UNSAT
Problem TDEAD2881 is UNSAT
Problem TDEAD2882 is UNSAT
Problem TDEAD2883 is UNSAT
Problem TDEAD2884 is UNSAT
Problem TDEAD2885 is UNSAT
Problem TDEAD2886 is UNSAT
Problem TDEAD2887 is UNSAT
Problem TDEAD2888 is UNSAT
Problem TDEAD2889 is UNSAT
Problem TDEAD2890 is UNSAT
Problem TDEAD2891 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2893 is UNSAT
Problem TDEAD2894 is UNSAT
Problem TDEAD2895 is UNSAT
Problem TDEAD2899 is UNSAT
Problem TDEAD2900 is UNSAT
Problem TDEAD2901 is UNSAT
Problem TDEAD2902 is UNSAT
Problem TDEAD2903 is UNSAT
Problem TDEAD2904 is UNSAT
Problem TDEAD2905 is UNSAT
Problem TDEAD2906 is UNSAT
Problem TDEAD2907 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2909 is UNSAT
Problem TDEAD2910 is UNSAT
Problem TDEAD2915 is UNSAT
Problem TDEAD2916 is UNSAT
Problem TDEAD2917 is UNSAT
Problem TDEAD2918 is UNSAT
Problem TDEAD2919 is UNSAT
Problem TDEAD2920 is UNSAT
Problem TDEAD2921 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2923 is UNSAT
Problem TDEAD2924 is UNSAT
Problem TDEAD2925 is UNSAT
Problem TDEAD2926 is UNSAT
Problem TDEAD2927 is UNSAT
Problem TDEAD2928 is UNSAT
Problem TDEAD2929 is UNSAT
Problem TDEAD2930 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3091 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3107 is UNSAT
Problem TDEAD3108 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3125 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3127 is UNSAT
Problem TDEAD3128 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3149 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3158 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3161 is UNSAT
Problem TDEAD3162 is UNSAT
Problem TDEAD3163 is UNSAT
Problem TDEAD3164 is UNSAT
Problem TDEAD3165 is UNSAT
Problem TDEAD3166 is UNSAT
Problem TDEAD3167 is UNSAT
Problem TDEAD3168 is UNSAT
Problem TDEAD3169 is UNSAT
Problem TDEAD3170 is UNSAT
Problem TDEAD3171 is UNSAT
Problem TDEAD3172 is UNSAT
Problem TDEAD3173 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3175 is UNSAT
Problem TDEAD3176 is UNSAT
Problem TDEAD3177 is UNSAT
Problem TDEAD3178 is UNSAT
Problem TDEAD3179 is UNSAT
Problem TDEAD3180 is UNSAT
Problem TDEAD3181 is UNSAT
Problem TDEAD3182 is UNSAT
Problem TDEAD3183 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3185 is UNSAT
Problem TDEAD3186 is UNSAT
Problem TDEAD3187 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3189 is UNSAT
Problem TDEAD3190 is UNSAT
Problem TDEAD3191 is UNSAT
Problem TDEAD3192 is UNSAT
Problem TDEAD3193 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3195 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3197 is UNSAT
Problem TDEAD3198 is UNSAT
Problem TDEAD3199 is UNSAT
Problem TDEAD3200 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3203 is UNSAT
Problem TDEAD3204 is UNSAT
Problem TDEAD3205 is UNSAT
Problem TDEAD3206 is UNSAT
Problem TDEAD3207 is UNSAT
Problem TDEAD3208 is UNSAT
Problem TDEAD3209 is UNSAT
Problem TDEAD3210 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3212 is UNSAT
Problem TDEAD3213 is UNSAT
Problem TDEAD3214 is UNSAT
Problem TDEAD3215 is UNSAT
Problem TDEAD3216 is UNSAT
Problem TDEAD3217 is UNSAT
Problem TDEAD3218 is UNSAT
Problem TDEAD3219 is UNSAT
Problem TDEAD3220 is UNSAT
Problem TDEAD3221 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3223 is UNSAT
Problem TDEAD3224 is UNSAT
Problem TDEAD3225 is UNSAT
Problem TDEAD3226 is UNSAT
Problem TDEAD3227 is UNSAT
Problem TDEAD3228 is UNSAT
Problem TDEAD3229 is UNSAT
Problem TDEAD3230 is UNSAT
Problem TDEAD3231 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3233 is UNSAT
Problem TDEAD3234 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3236 is UNSAT
Problem TDEAD3237 is UNSAT
Problem TDEAD3238 is UNSAT
Problem TDEAD3239 is UNSAT
Problem TDEAD3240 is UNSAT
Problem TDEAD3241 is UNSAT
Problem TDEAD3242 is UNSAT
Problem TDEAD3243 is UNSAT
Problem TDEAD3244 is UNSAT
Problem TDEAD3245 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3247 is UNSAT
Problem TDEAD3248 is UNSAT
Problem TDEAD3249 is UNSAT
Problem TDEAD3250 is UNSAT
Problem TDEAD3251 is UNSAT
Problem TDEAD3252 is UNSAT
Problem TDEAD3253 is UNSAT
Problem TDEAD3254 is UNSAT
Problem TDEAD3255 is UNSAT
Problem TDEAD3256 is UNSAT
Problem TDEAD3257 is UNSAT
Problem TDEAD3258 is UNSAT
Problem TDEAD3259 is UNSAT
Problem TDEAD3260 is UNSAT
Problem TDEAD3261 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3263 is UNSAT
Problem TDEAD3264 is UNSAT
Problem TDEAD3265 is UNSAT
Problem TDEAD3266 is UNSAT
Problem TDEAD3267 is UNSAT
Problem TDEAD3268 is UNSAT
Problem TDEAD3269 is UNSAT
Problem TDEAD3270 is UNSAT
Problem TDEAD3271 is UNSAT
Problem TDEAD3272 is UNSAT
Problem TDEAD3273 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3275 is UNSAT
Problem TDEAD3276 is UNSAT
Problem TDEAD3277 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3279 is UNSAT
Problem TDEAD3280 is UNSAT
Problem TDEAD3281 is UNSAT
Problem TDEAD3282 is UNSAT
Problem TDEAD3283 is UNSAT
Problem TDEAD3284 is UNSAT
Problem TDEAD3285 is UNSAT
Problem TDEAD3286 is UNSAT
Problem TDEAD3287 is UNSAT
Problem TDEAD3288 is UNSAT
Problem TDEAD3289 is UNSAT
Problem TDEAD3290 is UNSAT
Problem TDEAD3291 is UNSAT
Problem TDEAD3292 is UNSAT
Problem TDEAD3293 is UNSAT
Problem TDEAD3294 is UNSAT
Problem TDEAD3295 is UNSAT
Problem TDEAD3296 is UNSAT
Problem TDEAD3297 is UNSAT
Problem TDEAD3298 is UNSAT
Problem TDEAD3299 is UNSAT
Problem TDEAD3300 is UNSAT
Problem TDEAD3301 is UNSAT
Problem TDEAD3302 is UNSAT
Problem TDEAD3303 is UNSAT
Problem TDEAD3304 is UNSAT
Problem TDEAD3305 is UNSAT
Problem TDEAD3306 is UNSAT
Problem TDEAD3307 is UNSAT
Problem TDEAD3308 is UNSAT
Problem TDEAD3309 is UNSAT
Problem TDEAD3310 is UNSAT
Problem TDEAD3311 is UNSAT
Problem TDEAD3312 is UNSAT
Problem TDEAD3313 is UNSAT
Problem TDEAD3314 is UNSAT
Problem TDEAD3315 is UNSAT
Problem TDEAD3316 is UNSAT
Problem TDEAD3317 is UNSAT
Problem TDEAD3318 is UNSAT
Problem TDEAD3319 is UNSAT
Problem TDEAD3320 is UNSAT
Problem TDEAD3321 is UNSAT
Problem TDEAD3322 is UNSAT
Problem TDEAD3323 is UNSAT
Problem TDEAD3324 is UNSAT
Problem TDEAD3325 is UNSAT
Problem TDEAD3326 is UNSAT
Problem TDEAD3327 is UNSAT
Problem TDEAD3328 is UNSAT
Problem TDEAD3329 is UNSAT
Problem TDEAD3330 is UNSAT
Problem TDEAD3331 is UNSAT
Problem TDEAD3332 is UNSAT
Problem TDEAD3333 is UNSAT
Problem TDEAD3334 is UNSAT
Problem TDEAD3335 is UNSAT
Problem TDEAD3336 is UNSAT
Problem TDEAD3337 is UNSAT
Problem TDEAD3338 is UNSAT
Problem TDEAD3339 is UNSAT
Problem TDEAD3340 is UNSAT
Problem TDEAD3341 is UNSAT
Problem TDEAD3342 is UNSAT
Problem TDEAD3343 is UNSAT
Problem TDEAD3344 is UNSAT
Problem TDEAD3345 is UNSAT
Problem TDEAD3346 is UNSAT
Problem TDEAD3347 is UNSAT
Problem TDEAD3348 is UNSAT
Problem TDEAD3349 is UNSAT
Problem TDEAD3350 is UNSAT
Problem TDEAD3351 is UNSAT
Problem TDEAD3352 is UNSAT
Problem TDEAD3353 is UNSAT
Problem TDEAD3354 is UNSAT
Problem TDEAD3355 is UNSAT
Problem TDEAD3356 is UNSAT
Problem TDEAD3357 is UNSAT
Problem TDEAD3358 is UNSAT
Problem TDEAD3359 is UNSAT
Problem TDEAD3360 is UNSAT
Problem TDEAD3361 is UNSAT
Problem TDEAD3362 is UNSAT
Problem TDEAD3363 is UNSAT
Problem TDEAD3364 is UNSAT
Problem TDEAD3365 is UNSAT
Problem TDEAD3366 is UNSAT
Problem TDEAD3367 is UNSAT
Problem TDEAD3368 is UNSAT
Problem TDEAD3369 is UNSAT
Problem TDEAD3370 is UNSAT
Problem TDEAD3371 is UNSAT
Problem TDEAD3372 is UNSAT
Problem TDEAD3373 is UNSAT
Problem TDEAD3374 is UNSAT
Problem TDEAD3375 is UNSAT
Problem TDEAD3376 is UNSAT
Problem TDEAD3377 is UNSAT
Problem TDEAD3378 is UNSAT
Problem TDEAD3379 is UNSAT
Problem TDEAD3380 is UNSAT
Problem TDEAD3381 is UNSAT
Problem TDEAD3382 is UNSAT
Problem TDEAD3383 is UNSAT
Problem TDEAD3384 is UNSAT
Problem TDEAD3385 is UNSAT
Problem TDEAD3386 is UNSAT
Problem TDEAD3387 is UNSAT
Problem TDEAD3388 is UNSAT
Problem TDEAD3389 is UNSAT
Problem TDEAD3390 is UNSAT
Problem TDEAD3391 is UNSAT
Problem TDEAD3392 is UNSAT
Problem TDEAD3393 is UNSAT
Problem TDEAD3646 is UNSAT
Problem TDEAD3647 is UNSAT
Problem TDEAD3648 is UNSAT
Problem TDEAD3649 is UNSAT
Problem TDEAD3650 is UNSAT
Problem TDEAD3651 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3653 is UNSAT
Problem TDEAD3654 is UNSAT
Problem TDEAD3655 is UNSAT
Problem TDEAD3656 is UNSAT
Problem TDEAD3657 is UNSAT
Problem TDEAD3658 is UNSAT
Problem TDEAD3659 is UNSAT
Problem TDEAD3660 is UNSAT
Problem TDEAD3661 is UNSAT
Problem TDEAD3662 is UNSAT
Problem TDEAD3663 is UNSAT
Problem TDEAD3664 is UNSAT
Problem TDEAD3665 is UNSAT
Problem TDEAD3666 is UNSAT
Problem TDEAD3667 is UNSAT
Problem TDEAD3668 is UNSAT
Problem TDEAD3669 is UNSAT
Problem TDEAD3670 is UNSAT
Problem TDEAD3671 is UNSAT
Problem TDEAD3672 is UNSAT
Problem TDEAD3673 is UNSAT
Problem TDEAD3674 is UNSAT
Problem TDEAD3675 is UNSAT
Problem TDEAD3676 is UNSAT
Problem TDEAD3677 is UNSAT
Problem TDEAD3678 is UNSAT
Problem TDEAD3679 is UNSAT
Problem TDEAD3680 is UNSAT
Problem TDEAD3681 is UNSAT
Problem TDEAD3682 is UNSAT
Problem TDEAD3683 is UNSAT
Problem TDEAD3684 is UNSAT
Problem TDEAD3685 is UNSAT
Problem TDEAD3686 is UNSAT
Problem TDEAD3687 is UNSAT
Problem TDEAD3688 is UNSAT
Problem TDEAD3689 is UNSAT
Problem TDEAD3690 is UNSAT
Problem TDEAD3691 is UNSAT
Problem TDEAD3692 is UNSAT
Problem TDEAD3693 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3695 is UNSAT
Problem TDEAD3696 is UNSAT
Problem TDEAD3697 is UNSAT
Problem TDEAD3698 is UNSAT
Problem TDEAD3699 is UNSAT
Problem TDEAD3700 is UNSAT
Problem TDEAD3701 is UNSAT
Problem TDEAD3702 is UNSAT
Problem TDEAD3703 is UNSAT
Problem TDEAD3704 is UNSAT
Problem TDEAD3705 is UNSAT
Problem TDEAD3706 is UNSAT
Problem TDEAD3707 is UNSAT
Problem TDEAD3708 is UNSAT
Problem TDEAD3709 is UNSAT
Problem TDEAD3710 is UNSAT
Problem TDEAD3711 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3713 is UNSAT
Problem TDEAD3714 is UNSAT
Problem TDEAD3715 is UNSAT
Problem TDEAD3716 is UNSAT
Problem TDEAD3717 is UNSAT
Problem TDEAD3718 is UNSAT
Problem TDEAD3719 is UNSAT
Problem TDEAD3720 is UNSAT
Problem TDEAD3721 is UNSAT
Problem TDEAD3722 is UNSAT
Problem TDEAD3723 is UNSAT
Problem TDEAD3724 is UNSAT
Problem TDEAD3725 is UNSAT
Problem TDEAD3726 is UNSAT
Problem TDEAD3727 is UNSAT
Problem TDEAD3728 is UNSAT
Problem TDEAD3729 is UNSAT
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3772 is UNSAT
Problem TDEAD3773 is UNSAT
Problem TDEAD3774 is UNSAT
Problem TDEAD3775 is UNSAT
Problem TDEAD3776 is UNSAT
Problem TDEAD3782 is UNSAT
Problem TDEAD3783 is UNSAT
Problem TDEAD3784 is UNSAT
Problem TDEAD3785 is UNSAT
Problem TDEAD3786 is UNSAT
Problem TDEAD3787 is UNSAT
Problem TDEAD3788 is UNSAT
Problem TDEAD3789 is UNSAT
Problem TDEAD3790 is UNSAT
Problem TDEAD3791 is UNSAT
Problem TDEAD3792 is UNSAT
Problem TDEAD3798 is UNSAT
Problem TDEAD3799 is UNSAT
Problem TDEAD3800 is UNSAT
Problem TDEAD3801 is UNSAT
Problem TDEAD3802 is UNSAT
Problem TDEAD3803 is UNSAT
Problem TDEAD3804 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3838 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3871 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3876 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 7/15 constraints. Problems are: Problem set: 654 solved, 3248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4008 variables, and 15 constraints, problems are : Problem set: 654 solved, 3248 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/279 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 7/7 constraints]
After SMT, in 105842ms problems are : Problem set: 654 solved, 3248 unsolved
Search for dead transitions found 654 dead transitions in 105916ms
Found 654 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 654 transitions
Dead transitions reduction (with SMT) removed 654 transitions
Starting structural reductions in LTL mode, iteration 1 : 279/280 places, 3250/3904 transitions.
Reduce places removed 44 places and 1001 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 235 transition count 2249
Reduce places removed 21 places and 395 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 65 place count 214 transition count 1854
Reduce places removed 10 places and 180 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 75 place count 204 transition count 1674
Reduce places removed 6 places and 105 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 81 place count 198 transition count 1569
Reduce places removed 4 places and 98 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 85 place count 194 transition count 1471
Reduce places removed 2 places and 29 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 87 place count 192 transition count 1442
Reduce places removed 1 places and 22 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 191 transition count 1420
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 102 place count 177 transition count 1250
Deduced a syphon composed of 7 places in 3 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 116 place count 177 transition count 1250
Deduced a syphon composed of 7 places in 3 ms
Applied a total of 116 rules in 37 ms. Remains 177 /279 variables (removed 102) and now considering 1250/3250 (removed 2000) transitions.
[2024-05-21 23:11:12] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
// Phase 1: matrix 1149 rows 177 cols
[2024-05-21 23:11:12] [INFO ] Computed 15 invariants in 10 ms
[2024-05-21 23:11:12] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 23:11:12] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
[2024-05-21 23:11:12] [INFO ] Invariant cache hit.
[2024-05-21 23:11:12] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-21 23:11:13] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 177/280 places, 1250/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110917 ms. Remains : 177/280 places, 1250/3904 transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Support contains 7 out of 170 places after structural reductions.
FORMULA BugTracking-PT-q8m016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:11:13] [INFO ] Flatten gal took : 170 ms
[2024-05-21 23:11:13] [INFO ] Flatten gal took : 99 ms
[2024-05-21 23:11:13] [INFO ] Input system was already deterministic with 1250 transitions.
RANDOM walk for 40000 steps (129 resets) in 1359 ms. (29 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (23 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (26 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-21 23:11:14] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
// Phase 1: matrix 1149 rows 170 cols
[2024-05-21 23:11:14] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 23:11:14] [INFO ] State equation strengthened by 138 read => feed constraints.
Problem AtomicPropp0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 570/609 variables, 39/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/609 variables, 28/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/609 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 414/1023 variables, 72/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1023 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 69/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1028 variables, 2/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1028 variables, 2/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 286/1314 variables, 54/270 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1314 variables, 2/272 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1314 variables, 41/313 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1314 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/1319 variables, 3/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1319 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1319 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 316 constraints, problems are : Problem set: 1 solved, 2 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/383 variables, 23/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 177/560 variables, 33/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 41/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/567 variables, 2/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 599/1166 variables, 46/152 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 60/213 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1166 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1166 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 142/1308 variables, 59/273 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1308 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1308 variables, 35/309 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1308 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/1313 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:11:15] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/1319 variables, 7/318 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1319 variables, 1/319 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:11:15] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1319 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1319 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1319 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 320 constraints, problems are : Problem set: 1 solved, 2 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1336ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1250/1250 transitions.
Graph (complete) has 1686 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 167 transition count 1253
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 167 transition count 1247
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 161 transition count 1247
Applied a total of 17 rules in 87 ms. Remains 161 /170 variables (removed 9) and now considering 1247/1250 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 161/170 places, 1247/1250 transitions.
RANDOM walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255252 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255252 steps, saw 129660 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 23:11:19] [INFO ] Flow matrix only has 1141 transitions (discarded 106 similar events)
// Phase 1: matrix 1141 rows 161 cols
[2024-05-21 23:11:19] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 23:11:19] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/383 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 313/696 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/696 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 60/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/696 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/697 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/697 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 476/1173 variables, 51/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1173 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1173 variables, 42/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1173 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/1299 variables, 52/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1299 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1299 variables, 36/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1299 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/1301 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1301 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1301 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1302 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1302 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1302 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1302/1302 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 360/383 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 313/696 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/696 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 60/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/696 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/696 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/697 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/697 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/697 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 476/1173 variables, 51/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1173 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1173 variables, 42/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1173 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1173 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 126/1299 variables, 52/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1299 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1299 variables, 36/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1299 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/1301 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1301 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:11:20] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1301 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1301 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/1302 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1302 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1302 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1302/1302 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1509ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 1247/1247 transitions.
Applied a total of 0 rules in 27 ms. Remains 161 /161 variables (removed 0) and now considering 1247/1247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 161/161 places, 1247/1247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 1247/1247 transitions.
Applied a total of 0 rules in 25 ms. Remains 161 /161 variables (removed 0) and now considering 1247/1247 (removed 0) transitions.
[2024-05-21 23:11:20] [INFO ] Flow matrix only has 1141 transitions (discarded 106 similar events)
[2024-05-21 23:11:20] [INFO ] Invariant cache hit.
[2024-05-21 23:11:21] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-21 23:11:21] [INFO ] Flow matrix only has 1141 transitions (discarded 106 similar events)
[2024-05-21 23:11:21] [INFO ] Invariant cache hit.
[2024-05-21 23:11:21] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-21 23:11:22] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2024-05-21 23:11:22] [INFO ] Redundant transitions in 91 ms returned []
Running 1246 sub problems to find dead transitions.
[2024-05-21 23:11:22] [INFO ] Flow matrix only has 1141 transitions (discarded 106 similar events)
[2024-05-21 23:11:22] [INFO ] Invariant cache hit.
[2024-05-21 23:11:22] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1246 unsolved
[2024-05-21 23:11:29] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:11:33] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
[2024-05-21 23:11:33] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
[2024-05-21 23:11:34] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
[2024-05-21 23:11:34] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 5/12 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1302 variables, 161/173 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1302 variables, 139/312 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1302/1302 variables, and 312 constraints, problems are : Problem set: 224 solved, 1022 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1246/1246 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 224 solved, 1022 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 5/12 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1302 variables, 161/173 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1302 variables, 139/312 constraints. Problems are: Problem set: 224 solved, 1022 unsolved
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1225 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1302 variables, 1022/1334 constraints. Problems are: Problem set: 347 solved, 899 unsolved
[2024-05-21 23:12:18] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:12:21] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-21 23:12:22] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1302/1302 variables, and 1337 constraints, problems are : Problem set: 419 solved, 827 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1022/1246 constraints, Known Traps: 8/8 constraints]
After SMT, in 64073ms problems are : Problem set: 419 solved, 827 unsolved
Search for dead transitions found 419 dead transitions in 64088ms
Found 419 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 419 transitions
Dead transitions reduction (with SMT) removed 419 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/161 places, 828/1247 transitions.
Graph (complete) has 1185 edges and 161 vertex of which 157 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 308 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 129 transition count 520
Reduce places removed 13 places and 69 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 42 place count 116 transition count 451
Reduce places removed 4 places and 33 transitions.
Graph (complete) has 638 edges and 112 vertex of which 2 are kept as prefixes of interest. Removing 110 places using SCC suffix rule.0 ms
Discarding 110 places :
Also discarding 418 output transitions
Drop transitions (Output transitions of discarded places.) removed 418 transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 47 rules in 6 ms. Remains 2 /161 variables (removed 159) and now considering 0/828 (removed 828) transitions.
[2024-05-21 23:12:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 23:12:26] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-21 23:12:26] [INFO ] Invariant cache hit.
[2024-05-21 23:12:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/161 places, 0/1247 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65593 ms. Remains : 2/161 places, 0/1247 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
FORMULA BugTracking-PT-q8m016-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 61 stable transitions
Graph (complete) has 1929 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1250/1250 transitions.
Graph (complete) has 1929 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 168 transition count 1251
Applied a total of 3 rules in 31 ms. Remains 168 /170 variables (removed 2) and now considering 1251/1250 (removed -1) transitions.
[2024-05-21 23:12:26] [INFO ] Flow matrix only has 1148 transitions (discarded 103 similar events)
// Phase 1: matrix 1148 rows 168 cols
[2024-05-21 23:12:26] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 23:12:26] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 23:12:26] [INFO ] Flow matrix only has 1148 transitions (discarded 103 similar events)
[2024-05-21 23:12:26] [INFO ] Invariant cache hit.
[2024-05-21 23:12:27] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-21 23:12:27] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-05-21 23:12:27] [INFO ] Redundant transitions in 16 ms returned []
Running 1249 sub problems to find dead transitions.
[2024-05-21 23:12:27] [INFO ] Flow matrix only has 1148 transitions (discarded 103 similar events)
[2024-05-21 23:12:27] [INFO ] Invariant cache hit.
[2024-05-21 23:12:27] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1249 unsolved
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
Problem TDEAD997 is UNSAT
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1015 is UNSAT
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
[2024-05-21 23:12:39] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1037 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 5/12 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 1148/1315 variables, 167/179 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1315 variables, 138/317 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1315/1316 variables, and 317 constraints, problems are : Problem set: 35 solved, 1214 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/168 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1249/1249 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 7/7 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 5/12 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 1148/1315 variables, 167/179 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1315 variables, 138/317 constraints. Problems are: Problem set: 35 solved, 1214 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1315 variables, 1138/1455 constraints. Problems are: Problem set: 138 solved, 1111 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1315/1316 variables, and 1455 constraints, problems are : Problem set: 138 solved, 1111 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/168 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1138/1249 constraints, Known Traps: 5/5 constraints]
After SMT, in 64885ms problems are : Problem set: 138 solved, 1111 unsolved
Search for dead transitions found 138 dead transitions in 64896ms
Found 138 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 138 transitions
Dead transitions reduction (with SMT) removed 138 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/170 places, 1113/1250 transitions.
Reduce places removed 23 places and 358 transitions.
Reduce places removed 12 places and 114 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 133 transition count 641
Reduce places removed 3 places and 28 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 130 transition count 613
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 128 transition count 593
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 20 place count 125 transition count 567
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 125 transition count 567
Applied a total of 23 rules in 41 ms. Remains 125 /168 variables (removed 43) and now considering 567/1113 (removed 546) transitions.
[2024-05-21 23:13:32] [INFO ] Flow matrix only has 541 transitions (discarded 26 similar events)
// Phase 1: matrix 541 rows 125 cols
[2024-05-21 23:13:32] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 23:13:32] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:13:32] [INFO ] Flow matrix only has 541 transitions (discarded 26 similar events)
[2024-05-21 23:13:32] [INFO ] Invariant cache hit.
[2024-05-21 23:13:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 23:13:33] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/170 places, 567/1250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66593 ms. Remains : 125/170 places, 567/1250 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m016-LTLCardinality-01
Product exploration explored 100000 steps with 330 reset in 375 ms.
Product exploration explored 100000 steps with 331 reset in 269 ms.
Computed a total of 5 stabilizing places and 42 stable transitions
Computed a total of 5 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 3419 steps (15 resets) in 10 ms. (310 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 567/567 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2024-05-21 23:13:34] [INFO ] Flow matrix only has 541 transitions (discarded 26 similar events)
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:13:34] [INFO ] Flow matrix only has 541 transitions (discarded 26 similar events)
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-21 23:13:34] [INFO ] Redundant transitions in 2 ms returned []
Running 565 sub problems to find dead transitions.
[2024-05-21 23:13:34] [INFO ] Flow matrix only has 541 transitions (discarded 26 similar events)
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-05-21 23:13:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
[2024-05-21 23:13:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:13:38] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
[2024-05-21 23:13:38] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
[2024-05-21 23:13:38] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 5/13 constraints. Problems are: Problem set: 37 solved, 528 unsolved
[2024-05-21 23:13:39] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
[2024-05-21 23:13:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:13:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 3/16 constraints. Problems are: Problem set: 37 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 37 solved, 528 unsolved
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 4 (OVERLAPS) 541/665 variables, 124/140 constraints. Problems are: Problem set: 41 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 85/225 constraints. Problems are: Problem set: 41 solved, 524 unsolved
[2024-05-21 23:13:45] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:13:45] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:13:45] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD417 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 3/228 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/228 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 1/666 variables, 1/229 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/229 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/229 constraints. Problems are: Problem set: 43 solved, 522 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 229 constraints, problems are : Problem set: 43 solved, 522 unsolved in 25915 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 43 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 11/19 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 541/665 variables, 124/143 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 85/228 constraints. Problems are: Problem set: 43 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 448/676 constraints. Problems are: Problem set: 43 solved, 522 unsolved
[2024-05-21 23:14:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
[2024-05-21 23:14:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
[2024-05-21 23:14:12] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
Problem TDEAD420 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 3/679 constraints. Problems are: Problem set: 99 solved, 466 unsolved
[2024-05-21 23:14:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:14:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 2/681 constraints. Problems are: Problem set: 99 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/666 variables, and 681 constraints, problems are : Problem set: 99 solved, 466 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/125 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 448/565 constraints, Known Traps: 16/16 constraints]
After SMT, in 56903ms problems are : Problem set: 99 solved, 466 unsolved
Search for dead transitions found 99 dead transitions in 56909ms
Found 99 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 99 transitions
Dead transitions reduction (with SMT) removed 99 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 468/567 transitions.
Graph (complete) has 834 edges and 125 vertex of which 122 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 7 places and 73 transitions.
Reduce places removed 4 places and 36 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 111 transition count 359
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 110 transition count 351
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 109 transition count 343
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 11 place count 105 transition count 315
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 105 transition count 315
Applied a total of 15 rules in 28 ms. Remains 105 /125 variables (removed 20) and now considering 315/468 (removed 153) transitions.
[2024-05-21 23:14:31] [INFO ] Flow matrix only has 296 transitions (discarded 19 similar events)
// Phase 1: matrix 296 rows 105 cols
[2024-05-21 23:14:31] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 23:14:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:14:31] [INFO ] Flow matrix only has 296 transitions (discarded 19 similar events)
[2024-05-21 23:14:31] [INFO ] Invariant cache hit.
[2024-05-21 23:14:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 23:14:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/125 places, 315/567 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57743 ms. Remains : 105/125 places, 315/567 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 3732 steps (6 resets) in 12 ms. (287 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 330 reset in 226 ms.
Product exploration explored 100000 steps with 321 reset in 282 ms.
Built C files in :
/tmp/ltsmin12097998433616215951
[2024-05-21 23:14:32] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-05-21 23:14:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:32] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-05-21 23:14:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:32] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-05-21 23:14:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:32] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12097998433616215951
Running compilation step : cd /tmp/ltsmin12097998433616215951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 872 ms.
Running link step : cd /tmp/ltsmin12097998433616215951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12097998433616215951;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2467543808982695471.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 315/315 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-05-21 23:14:47] [INFO ] Flow matrix only has 296 transitions (discarded 19 similar events)
[2024-05-21 23:14:47] [INFO ] Invariant cache hit.
[2024-05-21 23:14:48] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:14:48] [INFO ] Flow matrix only has 296 transitions (discarded 19 similar events)
[2024-05-21 23:14:48] [INFO ] Invariant cache hit.
[2024-05-21 23:14:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 23:14:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 23:14:48] [INFO ] Redundant transitions in 1 ms returned []
Running 313 sub problems to find dead transitions.
[2024-05-21 23:14:48] [INFO ] Flow matrix only has 296 transitions (discarded 19 similar events)
[2024-05-21 23:14:48] [INFO ] Invariant cache hit.
[2024-05-21 23:14:48] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:14:49] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 3 (OVERLAPS) 296/400 variables, 104/117 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 58/175 constraints. Problems are: Problem set: 32 solved, 281 unsolved
[2024-05-21 23:14:52] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 1/176 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/176 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/177 constraints. Problems are: Problem set: 32 solved, 281 unsolved
[2024-05-21 23:14:57] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/178 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/178 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/178 constraints. Problems are: Problem set: 32 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 178 constraints, problems are : Problem set: 32 solved, 281 unsolved in 13584 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 32 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/15 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 296/400 variables, 104/119 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 58/177 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 225/402 constraints. Problems are: Problem set: 32 solved, 281 unsolved
[2024-05-21 23:15:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/403 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/403 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/404 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 56/460 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/460 constraints. Problems are: Problem set: 32 solved, 281 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/460 constraints. Problems are: Problem set: 32 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 460 constraints, problems are : Problem set: 32 solved, 281 unsolved in 17894 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 281/313 constraints, Known Traps: 9/9 constraints]
After SMT, in 31708ms problems are : Problem set: 32 solved, 281 unsolved
Search for dead transitions found 32 dead transitions in 31711ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/105 places, 283/315 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-05-21 23:15:20] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 32039 ms. Remains : 105/105 places, 283/315 transitions.
Built C files in :
/tmp/ltsmin2455163280846855814
[2024-05-21 23:15:20] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2024-05-21 23:15:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:20] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2024-05-21 23:15:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:20] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
[2024-05-21 23:15:20] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2455163280846855814
Running compilation step : cd /tmp/ltsmin2455163280846855814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 700 ms.
Running link step : cd /tmp/ltsmin2455163280846855814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2455163280846855814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11182940275638089942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:15:35] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:15:35] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:15:35] [INFO ] Time to serialize gal into /tmp/LTL4382639048253167805.gal : 4 ms
[2024-05-21 23:15:35] [INFO ] Time to serialize properties into /tmp/LTL14777543472266172032.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4382639048253167805.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8124741464395212583.hoa' '-atoms' '/tmp/LTL14777543472266172032.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i4.u6.l30<=0)"))))
Formula 0 simplified : GF!"(i4.u6.l30<=0)"
Detected timeout of ITS tools.
Treatment of property BugTracking-PT-q8m016-LTLCardinality-01 finished in 234484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1250/1250 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1250/1250 (removed 0) transitions.
[2024-05-21 23:16:21] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
// Phase 1: matrix 1149 rows 170 cols
[2024-05-21 23:16:21] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 23:16:21] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 23:16:21] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
[2024-05-21 23:16:21] [INFO ] Invariant cache hit.
[2024-05-21 23:16:21] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-21 23:16:22] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 1248 sub problems to find dead transitions.
[2024-05-21 23:16:22] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
[2024-05-21 23:16:22] [INFO ] Invariant cache hit.
[2024-05-21 23:16:22] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-21 23:16:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
[2024-05-21 23:16:35] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
Problem TDEAD1002 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
[2024-05-21 23:16:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
[2024-05-21 23:16:35] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 5 (OVERLAPS) 1149/1319 variables, 170/182 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1319 variables, 138/320 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 320 constraints, problems are : Problem set: 230 solved, 1018 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 230 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 5 (OVERLAPS) 1149/1319 variables, 170/182 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1319 variables, 138/320 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1319 variables, 1018/1338 constraints. Problems are: Problem set: 290 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1338 constraints, problems are : Problem set: 290 solved, 958 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1018/1248 constraints, Known Traps: 4/4 constraints]
After SMT, in 66087ms problems are : Problem set: 290 solved, 958 unsolved
Search for dead transitions found 290 dead transitions in 66103ms
Found 290 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 290 transitions
Dead transitions reduction (with SMT) removed 290 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 960/1250 transitions.
Reduce places removed 17 places and 182 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 153 transition count 778
Reduce places removed 10 places and 37 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 143 transition count 741
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 142 transition count 728
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 141 transition count 715
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 34 place count 136 transition count 687
Iterating global reduction 4 with 5 rules applied. Total rules applied 39 place count 136 transition count 687
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 134 transition count 675
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 134 transition count 675
Applied a total of 43 rules in 10 ms. Remains 134 /170 variables (removed 36) and now considering 675/960 (removed 285) transitions.
[2024-05-21 23:17:28] [INFO ] Flow matrix only has 633 transitions (discarded 42 similar events)
// Phase 1: matrix 633 rows 134 cols
[2024-05-21 23:17:28] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 23:17:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:17:28] [INFO ] Flow matrix only has 633 transitions (discarded 42 similar events)
[2024-05-21 23:17:28] [INFO ] Invariant cache hit.
[2024-05-21 23:17:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 23:17:28] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/170 places, 675/1250 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67719 ms. Remains : 134/170 places, 675/1250 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m016-LTLCardinality-06
Stuttering criterion allowed to conclude after 484 steps with 1 reset in 2 ms.
FORMULA BugTracking-PT-q8m016-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m016-LTLCardinality-06 finished in 67800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1250/1250 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 1250
Applied a total of 1 rules in 3 ms. Remains 169 /170 variables (removed 1) and now considering 1250/1250 (removed 0) transitions.
[2024-05-21 23:17:28] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
// Phase 1: matrix 1149 rows 169 cols
[2024-05-21 23:17:28] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 23:17:28] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 23:17:28] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
[2024-05-21 23:17:28] [INFO ] Invariant cache hit.
[2024-05-21 23:17:29] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-05-21 23:17:29] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 1248 sub problems to find dead transitions.
[2024-05-21 23:17:29] [INFO ] Flow matrix only has 1149 transitions (discarded 101 similar events)
[2024-05-21 23:17:29] [INFO ] Invariant cache hit.
[2024-05-21 23:17:29] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
Problem TDEAD1002 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1020 is UNSAT
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
[2024-05-21 23:17:42] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 5/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1317 variables, 168/180 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 138/318 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1317/1318 variables, and 318 constraints, problems are : Problem set: 230 solved, 1018 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 230 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 5/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1317 variables, 168/180 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 138/318 constraints. Problems are: Problem set: 230 solved, 1018 unsolved
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1317 variables, 942/1260 constraints. Problems are: Problem set: 290 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/1318 variables, and 1260 constraints, problems are : Problem set: 290 solved, 958 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/169 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 942/1248 constraints, Known Traps: 5/5 constraints]
After SMT, in 65133ms problems are : Problem set: 290 solved, 958 unsolved
Search for dead transitions found 290 dead transitions in 65145ms
Found 290 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 290 transitions
Dead transitions reduction (with SMT) removed 290 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/170 places, 960/1250 transitions.
Reduce places removed 17 places and 182 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 152 transition count 778
Reduce places removed 10 places and 37 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 27 place count 142 transition count 741
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 141 transition count 728
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 140 transition count 715
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 34 place count 135 transition count 687
Iterating global reduction 4 with 5 rules applied. Total rules applied 39 place count 135 transition count 687
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 133 transition count 675
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 133 transition count 675
Applied a total of 43 rules in 9 ms. Remains 133 /169 variables (removed 36) and now considering 675/960 (removed 285) transitions.
[2024-05-21 23:18:34] [INFO ] Flow matrix only has 633 transitions (discarded 42 similar events)
// Phase 1: matrix 633 rows 133 cols
[2024-05-21 23:18:34] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 23:18:35] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:18:35] [INFO ] Flow matrix only has 633 transitions (discarded 42 similar events)
[2024-05-21 23:18:35] [INFO ] Invariant cache hit.
[2024-05-21 23:18:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 23:18:35] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/170 places, 675/1250 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66562 ms. Remains : 133/170 places, 675/1250 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m016-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BugTracking-PT-q8m016-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m016-LTLCardinality-15 finished in 66654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-21 23:18:35] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2062660729202211488
[2024-05-21 23:18:35] [INFO ] Computing symmetric may disable matrix : 1250 transitions.
[2024-05-21 23:18:35] [INFO ] Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:35] [INFO ] Applying decomposition
[2024-05-21 23:18:35] [INFO ] Computing symmetric may enable matrix : 1250 transitions.
[2024-05-21 23:18:35] [INFO ] Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:35] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14020453634788224377.txt' '-o' '/tmp/graph14020453634788224377.bin' '-w' '/tmp/graph14020453634788224377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14020453634788224377.bin' '-l' '-1' '-v' '-w' '/tmp/graph14020453634788224377.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:18:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:18:36] [INFO ] Removed a total of 274 redundant transitions.
[2024-05-21 23:18:36] [INFO ] Computing Do-Not-Accords matrix : 1250 transitions.
[2024-05-21 23:18:36] [INFO ] Flatten gal took : 101 ms
[2024-05-21 23:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 9 ms.
[2024-05-21 23:18:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality2495288204601857402.gal : 9 ms
[2024-05-21 23:18:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality18421523380221490370.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2495288204601857402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18421523380221490370.ltl' '-c' '-stutter-deadlock'
[2024-05-21 23:18:36] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2024-05-21 23:18:36] [INFO ] Built C files in 571ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2062660729202211488
Running compilation step : cd /tmp/ltsmin2062660729202211488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G("(u8.l30<=0)"))))
Formula 0 simplified : GF!"(u8.l30<=0)"
Compilation finished in 4834 ms.
Running link step : cd /tmp/ltsmin2062660729202211488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2062660729202211488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 23:41:41] [INFO ] Flatten gal took : 148 ms
[2024-05-21 23:41:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality8386775232370576003.gal : 24 ms
[2024-05-21 23:41:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality1294643198635043823.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8386775232370576003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1294643198635043823.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("(l30<=0)"))))
Formula 0 simplified : GF!"(l30<=0)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.197: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.395: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.955: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.492: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.492: Initializing POR dependencies: labels 1251, guards 1250
pins2lts-mc-linux64( 4/ 8), 1.777: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.836: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.883: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 11.850: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 11.850: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 11.850: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 13.195: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 13.238: There are 1252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 13.238: State length is 171, there are 1254 groups
pins2lts-mc-linux64( 0/ 8), 13.238: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 13.238: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 13.238: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 13.238: Visible groups: 0 / 1254, labels: 1 / 1252
pins2lts-mc-linux64( 0/ 8), 13.238: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 13.238: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 13.533: [Blue] ~120 levels ~960 states ~1816 transitions
pins2lts-mc-linux64( 2/ 8), 13.694: [Blue] ~163 levels ~1920 states ~2936 transitions
pins2lts-mc-linux64( 2/ 8), 14.141: [Blue] ~267 levels ~3840 states ~5720 transitions
pins2lts-mc-linux64( 2/ 8), 15.364: [Blue] ~606 levels ~7680 states ~12720 transitions
pins2lts-mc-linux64( 7/ 8), 18.189: [Blue] ~1552 levels ~15360 states ~30472 transitions
pins2lts-mc-linux64( 7/ 8), 25.399: [Blue] ~3173 levels ~30720 states ~61768 transitions
pins2lts-mc-linux64( 1/ 8), 38.097: [Blue] ~216 levels ~61440 states ~134856 transitions
pins2lts-mc-linux64( 7/ 8), 61.036: [Blue] ~12918 levels ~122880 states ~249856 transitions
pins2lts-mc-linux64( 7/ 8), 101.787: [Blue] ~25912 levels ~245760 states ~500400 transitions
pins2lts-mc-linux64( 7/ 8), 174.057: [Blue] ~51899 levels ~491520 states ~1001504 transitions
pins2lts-mc-linux64( 7/ 8), 226.083: [Blue] ~103861 levels ~983040 states ~2003880 transitions
pins2lts-mc-linux64( 7/ 8), 328.812: [Blue] ~207812 levels ~1966080 states ~4008832 transitions
pins2lts-mc-linux64( 7/ 8), 525.509: [Blue] ~415689 levels ~3932160 states ~8018448 transitions
pins2lts-mc-linux64( 7/ 8), 919.739: [Blue] ~831452 levels ~7864320 states ~16037744 transitions
pins2lts-mc-linux64( 7/ 8), 1692.829: [Blue] ~1662992 levels ~15728640 states ~32076552 transitions
pins2lts-mc-linux64( 7/ 8), 2383.723: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2383.810:
pins2lts-mc-linux64( 0/ 8), 2383.810: Explored 15853433 states 38443960 transitions, fanout: 2.425
pins2lts-mc-linux64( 0/ 8), 2383.810: Total exploration time 2370.540 sec (2370.470 sec minimum, 2370.504 sec on average)
pins2lts-mc-linux64( 0/ 8), 2383.810: States per second: 6688, Transitions per second: 16217
pins2lts-mc-linux64( 0/ 8), 2383.810:
pins2lts-mc-linux64( 0/ 8), 2383.810: State space has 31014919 states, 26421 are accepting
pins2lts-mc-linux64( 0/ 8), 2383.810: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2383.810: blue states: 15853433 (51.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2383.810: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2383.810: all-red states: 69485 (0.22%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2383.810:
pins2lts-mc-linux64( 0/ 8), 2383.810: Total memory used for local state coloring: 189.5MB
pins2lts-mc-linux64( 0/ 8), 2383.810:
pins2lts-mc-linux64( 0/ 8), 2383.810: Queue width: 8B, total height: 12419222, memory: 94.75MB
pins2lts-mc-linux64( 0/ 8), 2383.810: Tree memory: 492.6MB, 16.7 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 2383.810: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2383.810: Stored 1292 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2383.810: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2383.810: Est. total memory use: 587.4MB (~1118.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2062660729202211488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2062660729202211488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 00:04:46] [INFO ] Flatten gal took : 97 ms
[2024-05-22 00:04:46] [INFO ] Input system was already deterministic with 1250 transitions.
[2024-05-22 00:04:46] [INFO ] Transformed 170 places.
[2024-05-22 00:04:46] [INFO ] Transformed 1250 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:04:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality13670294717503908398.gal : 9 ms
[2024-05-22 00:04:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality13453548960029854259.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13670294717503908398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13453548960029854259.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(l30<=0)"))))
Formula 0 simplified : GF!"(l30<=0)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m016, 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 r048-tajo-171620399400411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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