fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r520-tall-171662337800105
Last Updated
July 7, 2024

About the Execution of LTSMin+red for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1584.552 235534.00 303723.00 510.80 T??TFFFT??F?FFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800105.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-32, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 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 QuasiCertifProtocol-PT-32-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-32-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717221616179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:00:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:00:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:00:17] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-01 06:00:17] [INFO ] Transformed 3806 places.
[2024-06-01 06:00:17] [INFO ] Transformed 506 transitions.
[2024-06-01 06:00:17] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Support contains 2718 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Applied a total of 0 rules in 115 ms. Remains 3806 /3806 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3806 cols
[2024-06-01 06:00:18] [INFO ] Computed 3301 invariants in 133 ms
[2024-06-01 06:00:49] [INFO ] Performed 1343/3806 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 06:00:49] [INFO ] Implicit Places using invariants in 31827 ms returned []
[2024-06-01 06:00:49] [INFO ] Invariant cache hit.
[2024-06-01 06:01:10] [INFO ] Implicit Places using invariants and state equation in 20219 ms returned []
Implicit Place search using SMT with State Equation took 52081 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-06-01 06:01:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4312 variables, and 2208 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 2208/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 2208/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3735 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 38/3773 variables, 3/2211 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-06-01 06:02:09] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 13 ms to minimize.
[2024-06-01 06:02:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:02:09] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:02:09] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
[2024-06-01 06:02:10] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
[2024-06-01 06:02:11] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:02:11] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:02:11] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 18)
(s37 1)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(s2277 1)
(s2278 1)
(s2279 1)
(s2280 1)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 1)
(s2286 1)
(s2287 1)
(s2288 1)
(s2289 1)
(s2290 1)
(s2291 1)
(s2292 1)
(s2293 1)
(s2294 1)
(s2295 1)
(s2296 1)
(s2297 1)
(s2298 1)
(s2299 1)
(s2300 1)
(s2301 1)
(s2302 1)
(s2303 1)
(s2304 1)
(s2305 1)
(s2306 1)
(s2307 1)
(s2308 1)
(s2309 1)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
(s2335 1)
(s2336 1)
(s2337 1)
(s2338 1)
(s2339 1)
(s2340 1)
(s2341 1)
(s2342 1)
(s2343 1)
(s2344 1)
(s2345 1)
(s2346 1)
(s2347 1)
(s2348 1)
(s2349 1)
(s2350 1)
(s2351 1)
(s2352 1)
(s2353 1)
(s2354 1)
(s2355 1)
(s2356 1)
(s2357 1)
(s2358 1)
(s2359 1)
(s2360 1)
(s2361 1)
(s2362 1)
(s2363 1)
(s2364 1)
(s2365 1)
(s2366 1)
(s2367 1)
(s2368 1)
(s2369 1)
(s2370 1)
(s2371 1)
(s2372 1)
(s2373 1)
(s2374 1)
(s2375 1)
(s2376 1)
(s2377 1)
(s2378 1)
(s2379 1)
(s2380 1)
(s2381 1)
(s2382 1)
(s2383 1)
(s2384 1)
(s2385 1)
(s2386 1)
(s2387 1)
(s2388 1)
(s2389 1)
(s2390 1)
(s2391 1)
(s2392 1)
(s2393 1)
(s2394 1)
(s2395 1)
(s2396 1)
(s2397 1)
(s2398 1)
(s2399 1)
(s2400 1)
(s2401 1)
(s2402 1)
(s2403 1)
(s2404 1)
(s2405 1)
(s2406 1)
(s2407 1)
(s2408 1)
(s2409 1)
(s2410 1)
(s2411 1)
(s2412 1)
(s2413 1)
(s2414 1)
(s2415 1)
(s2416 1)
(s2417 1)
(s2418 1)
(s2419 1)
(s2420 1)
(s2421 1)
(s2422 1)
(s2423 1)
(s2424 1)
(s2425 1)
(s2426 1)
(s2427 1)
(s2428 1)
(s2429 1)
(s2430 1)
(s2431 1)
(s2432 1)
(s2433 1)
(s2434 1)
(s2435 1)
(s2436 1)
(s2437 1)
(s2438 1)
(s2439 1)
(s2440 1)
(s2441 1)
(s2442 1)
(s2443 1)
(s2444 1)
(s2445 1)
(s2446 1)
(s2447 1)
(s2448 1)
(s2449 1)
(s2450 1)
(s2451 1)
(s2452 1)
(s2453 1)
(s2454 1)
(s2455 1)
(s2456 1)
(s2457 1)
(s2458 1)
(s2459 1)
(s2460 1)
(s2461 1)
(s2462 1)
(s2463 1)
(s2464 1)
(s2465 1)
(s2466 1)
(s2467 1)
(s2468 1)
(s2469 1)
(s2470 1)
(s2471 1)
(s2472 1)
(s2473 1)
(s2474 1)
(s2475 1)
(s2476 1)
(s2477 1)
(s2478 1)
(s2479 1)
(s2480 1)
(s2481 1)
(s2482 1)
(s2483 1)
(s2484 1)
(s2485 1)
(s2486 1)
(s2487 1)
(s2488 1)
(s2489 1)
(s2490 1)
(s2491 1)
(s2492 1)
(s2493 1)
(s2494 1)
(s2495 1)
(s2496 1)
(s2497 1)
(s2498 1)
(s2499 1)
(s2500 1)
(s2501 1)
(s2502 1)
(s2503 1)
(s2504 1)
(s2505 1)
(s2506 1)
(s2507 1)
(s2508 1)
(s2509 1)
(s2510 1)
(s2511 1)
(s2512 1)
(s2513 1)
(s2514 1)
(s2515 1)
(s2516 1)
(s2517 1)
(s2518 1)
(s2519 1)
(s2520 1)
(s2521 1)
(s2522 1)
(s2523 1)
(s2524 1)
(s2525 1)
(s2526 1)
(s2527 1)
(s2528 1)
(s2529 1)
(s2530 1)
(s2531 1)
(s2532 1)
(s2533 1)
(s2534 1)
(s2535 1)
(s2536 1)
(s2537 1)
(s2538 1)
(s2539 1)
(s2540 1)
(s2541 1)
(s2542 1)
(s2543 1)
(s2544 1)
(s2545 1)
(s2546 1)
(s2547 1)
(s2548 1)
(s2549 1)
(s2550 1)
(s2551 1)
(s2552 1)
(s2553 1)
(s2554 1)
(s2555 1)
(s2556 1)
(s2557 1)
(s2558 1)
(s2559 1)
(s2560 1)
(s2561 1)
(s2562 1)
(s2563 1)
(s2564 1)
(s2565 1)
(s2566 1)
(s2567 1)
(s2568 1)
(s2569 1)
(s2570 1)
(s2571 1)
(s2572 1)
(s2573 1)
(s2574 1)
(s2575 1)
(s2576 1)
(s2577 1)
(s2578 1)
(s2579 1)
(s2580 1)
(s2581 1)
(s2582 1)
(s2583 1)
(s2584 1)
(s2585 1)
(s2586 1)
(s2587 1)
(s2588 1)
(s2589 1)
(s2590 1)
(s2591 1)
(s2592 1)
(s2593 1)
(s2594 1)
(s2595 1)
(s2596 1)
(s2597 1)
(s2598 1)
(s2599 1)
(s2600 1)
(s2601 1)
(s2602 1)
(s2603 1)
(s2604 1)
(s2605 1)
(s2606 1)
(s2607 1)
(s2608 1)
(s2609 1)
(s2610 1)
(s2611 1)
(s2612 1)
(s2613 1)
(s2614 1)
(s2615 1)
(s2616 1)
(s2617 1)
(s2618 1)
(s2619 1)
(s2620 1)
(s2621 1)
(s2622 1)
(s2623 1)
(s2624 1)
(s2625 1)
(s2626 1)
(s2627 1)
(s2628 1)
(s2629 1)
(s2630 1)
(s2631 1)
(s2632 1)
(s2633 1)
(s2634 1)
(s2635 1)
(s2636 1)
(s2637 1)
(s2638 1)
(s2639 1)
(s2640 1)
(s2641 1)
(s2642 1)
(s2643 1)
(s2644 1)
(s2645 1)
(s2646 1)
(s2647 1)
(s2648 1)
(s2649 1)
(s2650 1)
(s2651 1)
(s2652 1)
(s2653 1)
(s2654 1)
(s2655 1)
(s2656 1)
(s2657 1)
(s2658 1)
(s2659 1)
(s2660 1)
(s2661 1)
(s2662 1)
(s2663 1)
(s2664 1)
(s2665 1)
(s2666 1)
(s2667 1)
(s2668 1)
(s2669 1)
(s2670 1)
(s2671 1)
(s2672 1)
(s2673 1)
(s2674 1)
(s2675 1)
(s2676 1)
(s2677 1)
(s2678 1)
(s2679 1)
(s2680 1)
(s2681 1)
(s2682 1)
(s2683 1)
(s2684 1)
(s2685 1)
(s2686 1)
(s2687 1)
(s2688 1)
(s2689 1)
(s2690 1)
(s2691 1)
(s2692 1)
(s2693 1)
(s2694 1)
(s2695 1)
(s2696 1)
(s2697 1)
(s2698 1)
(s2699 1)
(s2700 1)
(s2701 1)
(s2702 1)
(s2703 1)
(s2704 1)
(s2705 1)
(s2706 1)
(s2707 1)
(s2708 1)
(s2709 1)
(s2710 1)
(s2711 1)
(s2712 1)
(s2713 1)
(s2714 1)
(s2715 1)
(s2716 1)
(s2717 1)
(s2718 1)
(s2719 1)
(s2720 1)
(s2721 1)
(s2722 1)
(s2723 1)
(s2724 1)
(s2725 1)
(s2726 1)
(s2727 1)
(s2728 1)
(s2729 1)
(s2730 1)
(s2731 1)
(s2732 1)
(s2733 1)
(s2734 1)
(s2735 1)
(s2736 1)
(s2737 1)
(s2738 1)
(s2739 1)
(s2740 1)
(s2741 1)
(s2742 1)
(s2743 1)
(s2744 1)
(s2745 1)
(s2746 1)
(s2747 1)
(s2748 1)
(s2749 1)
(s2750 1)
(s2751 1)
(s2752 1)
(s2753 1)
(s2754 1)
(s2755 1)
(s2756 1)
(s2757 1)
(s2758 1)
(s2759 1)
(s2760 1)
(s2761 1)
(s2762 1)
(s2763 1)
(s2764 1)
(s2765 1)
(s2766 1)
(s2767 1)
(s2768 1)
(s2769 1)
(s2770 1)
(s2771 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/4312 variables, and 2226 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2208/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 15/15 constraints]
After SMT, in 61236ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61285ms
Finished structural reductions in LTL mode , in 1 iterations and 113504 ms. Remains : 3806/3806 places, 506/506 transitions.
Support contains 2718 out of 3806 places after structural reductions.
[2024-06-01 06:02:11] [INFO ] Flatten gal took : 228 ms
[2024-06-01 06:02:11] [INFO ] Flatten gal took : 142 ms
[2024-06-01 06:02:12] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40000 steps (1067 resets) in 4535 ms. (8 steps per ms) remains 101/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 39 ms. (10 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 36 ms. (10 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 101/101 properties
Probabilistic random walk after 100001 steps, saw 14774 distinct states, run finished after 1198 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 06:02:14] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2653 variables, 2211/2211 constraints. Problems are: Problem set: 3 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2653/4312 variables, and 2211 constraints, problems are : Problem set: 3 solved, 98 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 2211/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 2210/2210 constraints. Problems are: Problem set: 3 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2652/4312 variables, and 2210 constraints, problems are : Problem set: 3 solved, 98 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 2210/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 10263ms problems are : Problem set: 3 solved, 98 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2652 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3805 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 95 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 3805/3806 places, 506/506 transitions.
RANDOM walk for 40000 steps (1070 resets) in 3273 ms. (12 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 98/98 properties
Interrupted probabilistic random walk after 256427 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 98
Probabilistic random walk after 256427 steps, saw 34053 distinct states, run finished after 3006 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 506 rows 3805 cols
[2024-06-01 06:02:29] [INFO ] Computed 3300 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2652 variables, 2210/2210 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2652 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 2 (OVERLAPS) 66/2718 variables, 2/2212 constraints. Problems are: Problem set: 11 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2718 variables, 0/2212 constraints. Problems are: Problem set: 11 solved, 87 unsolved
Problem AtomicPropp76 is UNSAT
At refinement iteration 4 (OVERLAPS) 1087/3805 variables, 1088/3300 constraints. Problems are: Problem set: 12 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3805 variables, 0/3300 constraints. Problems are: Problem set: 12 solved, 86 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp102 is UNSAT
At refinement iteration 6 (OVERLAPS) 506/4311 variables, 3805/7105 constraints. Problems are: Problem set: 55 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4311/4311 variables, and 7105 constraints, problems are : Problem set: 55 solved, 43 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3298/3298 constraints, State Equation: 3805/3805 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 55 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2504 variables, 2146/2146 constraints. Problems are: Problem set: 55 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2504 variables, 0/2146 constraints. Problems are: Problem set: 55 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 135/2639 variables, 2/2148 constraints. Problems are: Problem set: 55 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2639 variables, 19/2167 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:19] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:03:19] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:03:19] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:03:19] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:03:19] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:03:20] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:03:21] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2639 variables, 20/2187 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:03:22] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:03:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:03:24] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 4 ms to minimize.
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2639 variables, 20/2207 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:25] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:03:26] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 4 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:03:27] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:03:28] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2639 variables, 20/2227 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:03:29] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2639 variables, 20/2247 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:03:31] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:03:32] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:03:34] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:03:34] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2639 variables, 18/2265 constraints. Problems are: Problem set: 55 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2639 variables, 0/2265 constraints. Problems are: Problem set: 55 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1104/3743 variables, 1102/3367 constraints. Problems are: Problem set: 55 solved, 43 unsolved
[2024-06-01 06:03:45] [INFO ] Deduced a trap composed of 8 places in 762 ms of which 9 ms to minimize.
[2024-06-01 06:03:46] [INFO ] Deduced a trap composed of 6 places in 767 ms of which 11 ms to minimize.
[2024-06-01 06:03:47] [INFO ] Deduced a trap composed of 6 places in 665 ms of which 8 ms to minimize.
[2024-06-01 06:03:47] [INFO ] Deduced a trap composed of 8 places in 756 ms of which 10 ms to minimize.
[2024-06-01 06:03:48] [INFO ] Deduced a trap composed of 8 places in 754 ms of which 9 ms to minimize.
[2024-06-01 06:03:49] [INFO ] Deduced a trap composed of 6 places in 745 ms of which 8 ms to minimize.
[2024-06-01 06:03:50] [INFO ] Deduced a trap composed of 8 places in 747 ms of which 9 ms to minimize.
[2024-06-01 06:03:51] [INFO ] Deduced a trap composed of 8 places in 746 ms of which 9 ms to minimize.
[2024-06-01 06:03:51] [INFO ] Deduced a trap composed of 8 places in 749 ms of which 9 ms to minimize.
[2024-06-01 06:03:52] [INFO ] Deduced a trap composed of 8 places in 766 ms of which 9 ms to minimize.
[2024-06-01 06:03:53] [INFO ] Deduced a trap composed of 8 places in 748 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3743 variables, 11/3378 constraints. Problems are: Problem set: 55 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3743/4311 variables, and 3378 constraints, problems are : Problem set: 55 solved, 43 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3267/3298 constraints, State Equation: 0/3805 constraints, PredecessorRefiner: 0/98 constraints, Known Traps: 109/109 constraints]
After SMT, in 90282ms problems are : Problem set: 55 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2504 out of 3805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3805/3805 places, 506/506 transitions.
Graph (complete) has 43440 edges and 3805 vertex of which 3771 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3771 transition count 503
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3770 transition count 502
Applied a total of 5 rules in 224 ms. Remains 3770 /3805 variables (removed 35) and now considering 502/506 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 3770/3805 places, 502/506 transitions.
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:04:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 06:04:00] [INFO ] Flatten gal took : 99 ms
[2024-06-01 06:04:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:04:00] [INFO ] Flatten gal took : 104 ms
[2024-06-01 06:04:00] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 2451 out of 3806 places (down from 2463) after GAL structural reductions.
Computed a total of 3806 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3806 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2582 are kept as prefixes of interest. Removing 1224 places using SCC suffix rule.24 ms
Discarding 1224 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Applied a total of 99 rules in 310 ms. Remains 2547 /3806 variables (removed 1259) and now considering 374/506 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 310 ms. Remains : 2547/3806 places, 374/506 transitions.
[2024-06-01 06:04:00] [INFO ] Flatten gal took : 58 ms
[2024-06-01 06:04:00] [INFO ] Flatten gal took : 61 ms
[2024-06-01 06:04:01] [INFO ] Input system was already deterministic with 374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 3737 transition count 506
Applied a total of 69 rules in 108 ms. Remains 3737 /3806 variables (removed 69) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 3737/3806 places, 506/506 transitions.
[2024-06-01 06:04:01] [INFO ] Flatten gal took : 83 ms
[2024-06-01 06:04:01] [INFO ] Flatten gal took : 84 ms
[2024-06-01 06:04:01] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2582 are kept as prefixes of interest. Removing 1224 places using SCC suffix rule.14 ms
Discarding 1224 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Applied a total of 99 rules in 167 ms. Remains 2547 /3806 variables (removed 1259) and now considering 374/506 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 167 ms. Remains : 2547/3806 places, 374/506 transitions.
[2024-06-01 06:04:01] [INFO ] Flatten gal took : 54 ms
[2024-06-01 06:04:01] [INFO ] Flatten gal took : 55 ms
[2024-06-01 06:04:01] [INFO ] Input system was already deterministic with 374 transitions.
RANDOM walk for 40000 steps (895 resets) in 964 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 796 ms. (50 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 735306 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 735306 steps, saw 90799 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
// Phase 1: matrix 374 rows 2547 cols
[2024-06-01 06:04:05] [INFO ] Computed 2176 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1089 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1122/2211 variables, 1088/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2211 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2310/2921 variables, and 4323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1513 ms.
Refiners :[Generalized P Invariants (flows): 2112/2176 constraints, State Equation: 2211/2547 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1089 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1122/2211 variables, 1088/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2211 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2310/2921 variables, and 4323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1462 ms.
Refiners :[Generalized P Invariants (flows): 2112/2176 constraints, State Equation: 2211/2547 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1089 out of 2547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2547/2547 places, 374/374 transitions.
Graph (complete) has 39803 edges and 2547 vertex of which 2545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 2479 transition count 167
Ensure Unique test removed 33 places
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 339 place count 2411 transition count 167
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 339 place count 2411 transition count 101
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 537 place count 2279 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 538 place count 2279 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 539 place count 2278 transition count 100
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 1056 places
Reduce places removed 1089 places and 0 transitions.
Iterating global reduction 4 with 1122 rules applied. Total rules applied 1661 place count 1189 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1662 place count 1188 transition count 66
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 1695 place count 1155 transition count 66
Applied a total of 1695 rules in 341 ms. Remains 1155 /2547 variables (removed 1392) and now considering 66/374 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 1155/2547 places, 66/374 transitions.
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA QuasiCertifProtocol-PT-32-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3636 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.11 ms
Discarding 170 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Applied a total of 3 rules in 513 ms. Remains 3634 /3806 variables (removed 172) and now considering 501/506 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 513 ms. Remains : 3634/3806 places, 501/506 transitions.
[2024-06-01 06:04:09] [INFO ] Flatten gal took : 73 ms
[2024-06-01 06:04:09] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:04:09] [INFO ] Input system was already deterministic with 501 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 217 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 3736/3806 places, 506/506 transitions.
[2024-06-01 06:04:09] [INFO ] Flatten gal took : 84 ms
[2024-06-01 06:04:09] [INFO ] Flatten gal took : 75 ms
[2024-06-01 06:04:10] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 243 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 3736/3806 places, 506/506 transitions.
[2024-06-01 06:04:10] [INFO ] Flatten gal took : 86 ms
[2024-06-01 06:04:10] [INFO ] Flatten gal took : 83 ms
[2024-06-01 06:04:10] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3126 are kept as prefixes of interest. Removing 680 places using SCC suffix rule.12 ms
Discarding 680 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 3125 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 3124 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 3124 transition count 472
Applied a total of 17 rules in 377 ms. Remains 3124 /3806 variables (removed 682) and now considering 472/506 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 377 ms. Remains : 3124/3806 places, 472/506 transitions.
[2024-06-01 06:04:11] [INFO ] Flatten gal took : 60 ms
[2024-06-01 06:04:11] [INFO ] Flatten gal took : 62 ms
[2024-06-01 06:04:11] [INFO ] Input system was already deterministic with 472 transitions.
[2024-06-01 06:04:11] [INFO ] Flatten gal took : 76 ms
[2024-06-01 06:04:11] [INFO ] Flatten gal took : 77 ms
[2024-06-01 06:04:11] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:04:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3806 places, 506 transitions and 8173 arcs took 10 ms.
Total runtime 234032 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-01
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-02
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-32-CTLCardinality-2024-15

BK_STOP 1717221851713

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/928/ctl_0_
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/928/ctl_1_
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/928/ctl_2_
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/928/ctl_3_
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/928/ctl_4_
ctl formula name QuasiCertifProtocol-PT-32-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/928/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-32, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337800105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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