About the Execution of GreatSPN+red for CANConstruction-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13305.672 | 481895.00 | 1631782.00 | 396.80 | FFF?TTFTTFFFTTTF | 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.r069-tall-171620503600023.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 CANConstruction-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600023
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K 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 CANConstruction-PT-020-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716361821019
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:10:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:10:22] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-22 07:10:22] [INFO ] Transformed 1042 places.
[2024-05-22 07:10:22] [INFO ] Transformed 1760 transitions.
[2024-05-22 07:10:22] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (114 resets) in 1658 ms. (24 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
// Phase 1: matrix 1760 rows 1042 cols
[2024-05-22 07:10:23] [INFO ] Computed 41 invariants in 31 ms
[2024-05-22 07:10:23] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-020-ReachabilityFireability-2024-00 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-020-ReachabilityFireability-2024-02 is UNSAT
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 904/1028 variables, 21/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 6/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/1042 variables, 14/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1042 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1760/2802 variables, 1042/1083 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2802 variables, 780/1863 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/2802 variables, 0/1863 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2802/2802 variables, and 1863 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1042/1042 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 921/1027 variables, 21/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 5/26 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 07:10:25] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 61 ms to minimize.
[2024-05-22 07:10:26] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 6 ms to minimize.
[2024-05-22 07:10:26] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 5 ms to minimize.
[2024-05-22 07:10:26] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 5 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 5 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 5 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 6 ms to minimize.
[2024-05-22 07:10:27] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 5 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 5 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 47 places in 233 ms of which 5 ms to minimize.
[2024-05-22 07:10:28] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 5 ms to minimize.
[2024-05-22 07:10:29] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:10:29] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 4 ms to minimize.
[2024-05-22 07:10:29] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 4 ms to minimize.
[2024-05-22 07:10:29] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(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)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 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)
(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)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)timeout
(s492 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1027/2802 variables, and 42 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 5/20 constraints, State Equation: 0/1042 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 6568ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 1683
Reduce places removed 77 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 101 rules applied. Total rules applied 178 place count 965 transition count 1659
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 202 place count 941 transition count 1659
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 202 place count 941 transition count 1647
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 226 place count 929 transition count 1647
Discarding 324 places :
Symmetric choice reduction at 3 with 324 rule applications. Total rules 550 place count 605 transition count 999
Iterating global reduction 3 with 324 rules applied. Total rules applied 874 place count 605 transition count 999
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 888 place count 598 transition count 992
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 892 place count 596 transition count 1018
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 898 place count 596 transition count 1012
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 904 place count 590 transition count 1012
Partial Free-agglomeration rule applied 33 times.
Drop transitions (Partial Free agglomeration) removed 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 937 place count 590 transition count 1012
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 942 place count 590 transition count 1012
Applied a total of 942 rules in 341 ms. Remains 590 /1042 variables (removed 452) and now considering 1012/1760 (removed 748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 590/1042 places, 1012/1760 transitions.
RANDOM walk for 40000 steps (232 resets) in 443 ms. (90 steps per ms) remains 2/3 properties
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
// Phase 1: matrix 1012 rows 590 cols
[2024-05-22 07:10:30] [INFO ] Computed 41 invariants in 6 ms
[2024-05-22 07:10:30] [INFO ] State equation strengthened by 835 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 497/572 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/573 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 17/590 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1012/1602 variables, 590/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 835/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1602 variables, 0/1466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 1466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 590/590 constraints, ReadFeed: 835/835 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 497/572 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:31] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 4 ms to minimize.
[2024-05-22 07:10:31] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 4 ms to minimize.
[2024-05-22 07:10:31] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:10:32] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:10:33] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:10:34] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 3 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 3 ms to minimize.
[2024-05-22 07:10:35] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 5 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:10:36] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:10:37] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 17/590 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 6 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:38] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:10:39] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:10:40] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:10:41] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1012/1602 variables, 590/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1602 variables, 835/1547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1602 variables, 2/1549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1602 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1602 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1602/1602 variables, and 1549 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11581 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 590/590 constraints, ReadFeed: 835/835 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 81/81 constraints]
After SMT, in 12238ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA CANConstruction-PT-020-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
Support contains 73 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 1012/1012 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 590 transition count 1011
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 589 transition count 1009
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 587 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 586 transition count 1007
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 586 transition count 1007
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 578 transition count 999
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 577 transition count 999
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 577 transition count 998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 576 transition count 998
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 575 transition count 996
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 575 transition count 996
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 33 place count 575 transition count 996
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 575 transition count 996
Applied a total of 34 rules in 204 ms. Remains 575 /590 variables (removed 15) and now considering 996/1012 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 575/590 places, 996/1012 transitions.
RANDOM walk for 40000 steps (252 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 498590 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 498590 steps, saw 105021 distinct states, run finished after 3004 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 996 rows 575 cols
[2024-05-22 07:10:46] [INFO ] Computed 41 invariants in 5 ms
[2024-05-22 07:10:46] [INFO ] State equation strengthened by 846 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 484/557 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/558 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/575 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 996/1571 variables, 575/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1571 variables, 846/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1571 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1571 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1571/1571 variables, and 1462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, ReadFeed: 846/846 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/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 484/557 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:10:46] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 4 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:10:47] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:10:48] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:10:49] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:50] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 4 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:10:51] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:10:52] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 3 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:10:53] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:10:54] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:10:55] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/575 variables, 17/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:10:56] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 996/1571 variables, 575/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1571 variables, 846/1547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1571 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1571 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1571 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1571/1571 variables, and 1548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10727 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 575/575 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 85/85 constraints]
After SMT, in 11209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 73 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 996/996 transitions.
Applied a total of 0 rules in 20 ms. Remains 575 /575 variables (removed 0) and now considering 996/996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 575/575 places, 996/996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 996/996 transitions.
Applied a total of 0 rules in 22 ms. Remains 575 /575 variables (removed 0) and now considering 996/996 (removed 0) transitions.
[2024-05-22 07:10:57] [INFO ] Invariant cache hit.
[2024-05-22 07:10:57] [INFO ] Implicit Places using invariants in 303 ms returned [7, 13, 20, 28, 54, 62, 69, 76, 83, 91, 99, 104, 120, 127, 134, 141, 146]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 315 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 558/575 places, 996/996 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 558 transition count 994
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 556 transition count 994
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 23 place count 537 transition count 975
Iterating global reduction 2 with 19 rules applied. Total rules applied 42 place count 537 transition count 975
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 530 transition count 968
Applied a total of 56 rules in 100 ms. Remains 530 /558 variables (removed 28) and now considering 968/996 (removed 28) transitions.
// Phase 1: matrix 968 rows 530 cols
[2024-05-22 07:10:57] [INFO ] Computed 24 invariants in 12 ms
[2024-05-22 07:10:58] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 07:10:58] [INFO ] Invariant cache hit.
[2024-05-22 07:10:58] [INFO ] State equation strengthened by 817 read => feed constraints.
[2024-05-22 07:10:59] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 530/575 places, 968/996 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2267 ms. Remains : 530/575 places, 968/996 transitions.
RANDOM walk for 40000 steps (253 resets) in 300 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 555230 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 555230 steps, saw 114064 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-22 07:11:02] [INFO ] Invariant cache hit.
[2024-05-22 07:11:02] [INFO ] State equation strengthened by 817 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/529 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/530 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 968/1498 variables, 530/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 817/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1498 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1498/1498 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 530/530 constraints, ReadFeed: 817/817 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/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 456/529 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 4 ms to minimize.
[2024-05-22 07:11:03] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:11:04] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:11:05] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/530 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:11:06] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:07] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:11:07] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:11:07] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:07] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:07] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 968/1498 variables, 530/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1498 variables, 817/1404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1498 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1498 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1498 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1498/1498 variables, and 1405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4902 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 530/530 constraints, ReadFeed: 817/817 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints]
After SMT, in 5318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 73 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 968/968 transitions.
Applied a total of 0 rules in 33 ms. Remains 530 /530 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 530/530 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 968/968 transitions.
Applied a total of 0 rules in 32 ms. Remains 530 /530 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-22 07:11:08] [INFO ] Invariant cache hit.
[2024-05-22 07:11:08] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 07:11:08] [INFO ] Invariant cache hit.
[2024-05-22 07:11:08] [INFO ] State equation strengthened by 817 read => feed constraints.
[2024-05-22 07:11:10] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-22 07:11:10] [INFO ] Redundant transitions in 60 ms returned []
Running 948 sub problems to find dead transitions.
[2024-05-22 07:11:10] [INFO ] Invariant cache hit.
[2024-05-22 07:11:10] [INFO ] State equation strengthened by 817 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 948 unsolved
[2024-05-22 07:11:17] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:11:18] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 3 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:11:19] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 4 ms to minimize.
[2024-05-22 07:11:20] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:11:21] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:11:21] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 948 unsolved
[2024-05-22 07:11:21] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:11:21] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:11:21] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:11:22] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:11:23] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:11:24] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 948 unsolved
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 5 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:11:32] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 4 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:11:33] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-22 07:11:34] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 948 unsolved
[2024-05-22 07:11:35] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:11:36] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:11:37] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 3 ms to minimize.
[2024-05-22 07:11:38] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 948 unsolved
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:11:39] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:11:40] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 30458ms, After SMT, problems are : Problem set: 0 solved, 948 unsolved
Search for dead transitions found 0 dead transitions in 30470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32391 ms. Remains : 530/530 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 624 edges and 530 vertex of which 186 / 530 are part of one of the 10 SCC in 4 ms
Free SCC test removed 176 places
Drop transitions (Empty/Sink Transition effects.) removed 343 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 684 edges and 354 vertex of which 346 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
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 35 rules applied. Total rules applied 37 place count 346 transition count 578
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Iterating post reduction 1 with 189 rules applied. Total rules applied 226 place count 311 transition count 424
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 2 with 235 rules applied. Total rules applied 461 place count 190 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 461 place count 190 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 463 place count 189 transition count 309
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 487 place count 165 transition count 269
Iterating global reduction 3 with 24 rules applied. Total rules applied 511 place count 165 transition count 269
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 527 place count 165 transition count 253
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 535 place count 161 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 544 place count 161 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 546 place count 160 transition count 240
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 564 place count 160 transition count 222
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 582 place count 142 transition count 222
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 590 place count 142 transition count 222
Applied a total of 590 rules in 54 ms. Remains 142 /530 variables (removed 388) and now considering 222/968 (removed 746) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 142 cols
[2024-05-22 07:11:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-22 07:11:40] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-22 07:11:40] [INFO ] [Real]Absence check using 14 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 07:11:40] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 07:11:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-22 07:11:40] [INFO ] [Nat]Absence check using 14 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 07:11:40] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 07:11:41] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 07:11:41] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 416 ms.
[2024-05-22 07:11:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-22 07:11:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 530 places, 968 transitions and 3640 arcs took 7 ms.
[2024-05-22 07:11:41] [INFO ] Flatten gal took : 83 ms
Total runtime 79163 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANConstruction-PT-020
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 530
TRANSITIONS: 968
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.003s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
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: 1526
MODEL NAME: /home/mcc/execution/411/model
530 places, 968 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 1716362302914
--------------------
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 ReachabilityFireability -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="CANConstruction-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-020, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;