About the Execution of GreatSPN+red for DoubleLock-PT-p1s3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13599.092 | 900711.00 | 2448765.00 | 1056.60 | TT?FTT?FFTF????T | 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.r135-tall-171631131400601.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 greatspnxred
Input is DoubleLock-PT-p1s3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400601
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 DoubleLock-PT-p1s3-CTLCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2023-12
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2023-14
FORMULA_NAME DoubleLock-PT-p1s3-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716392708123
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:45:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 15:45:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:45:09] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-05-22 15:45:09] [INFO ] Transformed 570 places.
[2024-05-22 15:45:09] [INFO ] Transformed 7568 transitions.
[2024-05-22 15:45:09] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 132 places in 47 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7312/7312 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 435 transition count 7312
Applied a total of 3 rules in 94 ms. Remains 435 /438 variables (removed 3) and now considering 7312/7312 (removed 0) transitions.
[2024-05-22 15:45:10] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 435 cols
[2024-05-22 15:45:10] [INFO ] Computed 3 invariants in 81 ms
[2024-05-22 15:45:11] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-22 15:45:11] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2024-05-22 15:45:11] [INFO ] Invariant cache hit.
[2024-05-22 15:45:12] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 15:45:44] [INFO ] Performed 69/435 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 15:46:04] [INFO ] Implicit Places using invariants and state equation in 53729 ms returned []
Implicit Place search using SMT with State Equation took 54740 ms to find 0 implicit places.
Running 7310 sub problems to find dead transitions.
[2024-05-22 15:46:04] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2024-05-22 15:46:04] [INFO ] Invariant cache hit.
[2024-05-22 15:46:05] [INFO ] State equation strengthened by 400 read => feed constraints.
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)
(s36 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)
(s64 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)
(s222 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 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/5406 variables, and 1 constraints, problems are : Problem set: 0 solved, 7310 unsolved in 30291 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7310/7310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/5406 variables, and 1 constraints, problems are : Problem set: 0 solved, 7310 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/435 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7310 constraints, Known Traps: 0/0 constraints]
After SMT, in 92619ms problems are : Problem set: 0 solved, 7310 unsolved
Search for dead transitions found 0 dead transitions in 92716ms
Starting structural reductions in LTL mode, iteration 1 : 435/438 places, 7312/7312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147615 ms. Remains : 435/438 places, 7312/7312 transitions.
Support contains 105 out of 435 places after structural reductions.
[2024-05-22 15:47:38] [INFO ] Flatten gal took : 402 ms
[2024-05-22 15:47:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:47:38] [INFO ] Flatten gal took : 257 ms
[2024-05-22 15:47:39] [INFO ] Input system was already deterministic with 7312 transitions.
Support contains 93 out of 435 places (down from 105) after GAL structural reductions.
RANDOM walk for 40012 steps (375 resets) in 2506 ms. (15 steps per ms) remains 44/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
[2024-05-22 15:47:40] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2024-05-22 15:47:40] [INFO ] Invariant cache hit.
[2024-05-22 15:47:40] [INFO ] State equation strengthened by 400 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 365/420 variables, 3/3 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/3 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4963/5383 variables, 420/423 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5383 variables, 398/821 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5383 variables, 0/821 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 23/5406 variables, 15/836 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5406 variables, 2/838 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5406 variables, 0/838 constraints. Problems are: Problem set: 31 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/5406 variables, 0/838 constraints. Problems are: Problem set: 31 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5406/5406 variables, and 838 constraints, problems are : Problem set: 31 solved, 10 unsolved in 3432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 10 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 397/420 variables, 3/3 constraints. Problems are: Problem set: 32 solved, 9 unsolved
[2024-05-22 15:47:44] [INFO ] Deduced a trap composed of 154 places in 597 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 32 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4963/5383 variables, 420/424 constraints. Problems are: Problem set: 32 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5383 variables, 398/822 constraints. Problems are: Problem set: 32 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5383 variables, 1/823 constraints. Problems are: Problem set: 32 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5383 variables, 0/823 constraints. Problems are: Problem set: 32 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5406/5406 variables, and 838 constraints, problems are : Problem set: 32 solved, 9 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 435/435 constraints, ReadFeed: 398/400 constraints, PredecessorRefiner: 1/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 8566ms problems are : Problem set: 32 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Graph (complete) has 11941 edges and 435 vertex of which 434 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 434 transition count 7185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 433 transition count 7057
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 433 transition count 7057
Applied a total of 130 rules in 370 ms. Remains 433 /435 variables (removed 2) and now considering 7057/7312 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 433/435 places, 7057/7312 transitions.
RANDOM walk for 40007 steps (372 resets) in 443 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (52 resets) in 107 ms. (370 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (53 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 98 ms. (404 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (55 resets) in 115 ms. (344 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
[2024-05-22 15:47:49] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
// Phase 1: matrix 4716 rows 433 cols
[2024-05-22 15:47:49] [INFO ] Computed 2 invariants in 50 ms
[2024-05-22 15:47:49] [INFO ] State equation strengthened by 400 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3820/3985 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3985 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3985 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1164/5149 variables, 268/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5149 variables, 376/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5149/5149 variables, and 835 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 142/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3820/3985 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3985 variables, 24/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3985 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1164/5149 variables, 268/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5149 variables, 376/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5149 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5149/5149 variables, and 839 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 46643ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 220 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 433/433 places, 7057/7057 transitions.
RANDOM walk for 40016 steps (370 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (55 resets) in 66 ms. (597 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
[2024-05-22 15:48:36] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2024-05-22 15:48:36] [INFO ] Invariant cache hit.
[2024-05-22 15:48:36] [INFO ] State equation strengthened by 400 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3801/3964 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3964 variables, 18/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3964 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1183/5147 variables, 268/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5147 variables, 382/833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5147 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/5149 variables, 2/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/5149 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5149/5149 variables, and 835 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3801/3964 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3964 variables, 18/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3964 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1183/5147 variables, 268/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5147/5149 variables, and 833 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46905 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 431/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 51274ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 7056
Applied a total of 1 rules in 201 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7057 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 433/433 places, 7056/7057 transitions.
Successfully simplified 32 atomic propositions for a total of 14 simplifications.
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:49:28] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-22 15:49:28] [INFO ] Flatten gal took : 188 ms
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:49:28] [INFO ] Flatten gal took : 200 ms
[2024-05-22 15:49:29] [INFO ] Input system was already deterministic with 7312 transitions.
Support contains 30 out of 435 places (down from 45) after GAL structural reductions.
Computed a total of 10 stabilizing places and 2144 stable transitions
Graph (complete) has 13608 edges and 435 vertex of which 434 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Graph (complete) has 13608 edges and 435 vertex of which 434 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 346 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 348 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:29] [INFO ] Flatten gal took : 170 ms
[2024-05-22 15:49:29] [INFO ] Flatten gal took : 184 ms
[2024-05-22 15:49:30] [INFO ] Input system was already deterministic with 7184 transitions.
RANDOM walk for 18750 steps (180 resets) in 126 ms. (147 steps per ms) remains 0/1 properties
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Graph (complete) has 13608 edges and 435 vertex of which 434 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 217 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:30] [INFO ] Flatten gal took : 158 ms
[2024-05-22 15:49:30] [INFO ] Flatten gal took : 181 ms
[2024-05-22 15:49:31] [INFO ] Input system was already deterministic with 7184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 34 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:31] [INFO ] Flatten gal took : 148 ms
[2024-05-22 15:49:31] [INFO ] Flatten gal took : 174 ms
[2024-05-22 15:49:32] [INFO ] Input system was already deterministic with 7184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 35 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 15:49:32] [INFO ] Flatten gal took : 161 ms
FORMULA DoubleLock-PT-p1s3-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:49:32] [INFO ] Flatten gal took : 184 ms
[2024-05-22 15:49:33] [INFO ] Input system was already deterministic with 7184 transitions.
Support contains 0 out of 433 places (down from 6) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Graph (complete) has 13608 edges and 435 vertex of which 434 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 202 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 202 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:33] [INFO ] Flatten gal took : 159 ms
[2024-05-22 15:49:33] [INFO ] Flatten gal took : 186 ms
[2024-05-22 15:49:33] [INFO ] Input system was already deterministic with 7184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 33 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:34] [INFO ] Flatten gal took : 165 ms
[2024-05-22 15:49:34] [INFO ] Flatten gal took : 185 ms
[2024-05-22 15:49:34] [INFO ] Input system was already deterministic with 7184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 433 transition count 7184
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 433 transition count 7184
Applied a total of 3 rules in 31 ms. Remains 433 /435 variables (removed 2) and now considering 7184/7312 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 433/435 places, 7184/7312 transitions.
[2024-05-22 15:49:34] [INFO ] Flatten gal took : 143 ms
[2024-05-22 15:49:35] [INFO ] Flatten gal took : 163 ms
[2024-05-22 15:49:35] [INFO ] Input system was already deterministic with 7184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 7312/7312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 7312
Applied a total of 1 rules in 18 ms. Remains 434 /435 variables (removed 1) and now considering 7312/7312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 434/435 places, 7312/7312 transitions.
[2024-05-22 15:49:35] [INFO ] Flatten gal took : 146 ms
[2024-05-22 15:49:35] [INFO ] Flatten gal took : 168 ms
[2024-05-22 15:49:36] [INFO ] Input system was already deterministic with 7312 transitions.
[2024-05-22 15:49:36] [INFO ] Flatten gal took : 174 ms
[2024-05-22 15:49:36] [INFO ] Flatten gal took : 184 ms
[2024-05-22 15:49:36] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-22 15:49:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 435 places, 7312 transitions and 29248 arcs took 32 ms.
Total runtime 267242 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p1s3
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 435
TRANSITIONS: 7312
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.123s, Sys 0.027s]
SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.021s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 583
MODEL NAME: /home/mcc/execution/407/model
435 places, 7312 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716393608834
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="DoubleLock-PT-p1s3"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DoubleLock-PT-p1s3, 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 r135-tall-171631131400601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s3.tgz
mv DoubleLock-PT-p1s3 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 '
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 ;