About the Execution of GreatSPN+red for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3413.724 | 172830.00 | 237602.00 | 582.30 | TFFTTFTTFTFTTTFT | 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.r575-smll-171734919800175.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 MedleyA-PT-22, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919800175
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717387475122
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 04:04:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 04:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 04:04:38] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-06-03 04:04:38] [INFO ] Transformed 307 places.
[2024-06-03 04:04:38] [INFO ] Transformed 740 transitions.
[2024-06-03 04:04:38] [INFO ] Found NUPN structural information;
[2024-06-03 04:04:38] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 749 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1167 resets) in 2952 ms. (13 steps per ms) remains 13/16 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (186 resets) in 728 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (230 resets) in 278 ms. (143 steps per ms) remains 12/13 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (237 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (205 resets) in 239 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (214 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (233 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (224 resets) in 1044 ms. (38 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (246 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (199 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (206 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (222 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (231 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (212 resets) in 349 ms. (114 steps per ms) remains 12/12 properties
// Phase 1: matrix 740 rows 307 cols
[2024-06-03 04:04:40] [INFO ] Computed 24 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-22-ReachabilityFireability-2024-10 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 139/225 variables, 10/96 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 139/235 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/235 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 82/307 variables, 14/249 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 82/331 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 638 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1948 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-15 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem MedleyA-PT-22-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/219 variables, 10/78 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 151/229 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-03 04:04:43] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 1/230 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-03 04:04:44] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/231 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/231 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 88/307 variables, 14/245 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 88/333 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-03 04:04:44] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-03 04:04:44] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-03 04:04:44] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 3/336 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/336 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 740/1047 variables, 307/643 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1047 variables, 7/650 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-03 04:04:46] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-03 04:04:46] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1047 variables, 2/652 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1047 variables, 0/652 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 652 constraints, problems are : Problem set: 5 solved, 7 unsolved in 5011 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 7/7 constraints]
After SMT, in 7615ms problems are : Problem set: 5 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 300 transition count 708
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 272 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 271 transition count 704
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 63 place count 271 transition count 697
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 264 transition count 697
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 161 place count 180 transition count 596
Iterating global reduction 3 with 84 rules applied. Total rules applied 245 place count 180 transition count 596
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 251 place count 180 transition count 590
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 274 place count 157 transition count 536
Iterating global reduction 4 with 23 rules applied. Total rules applied 297 place count 157 transition count 536
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 306 place count 148 transition count 513
Iterating global reduction 4 with 9 rules applied. Total rules applied 315 place count 148 transition count 513
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 318 place count 145 transition count 504
Iterating global reduction 4 with 3 rules applied. Total rules applied 321 place count 145 transition count 504
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 353 place count 129 transition count 488
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 355 place count 127 transition count 486
Iterating global reduction 4 with 2 rules applied. Total rules applied 357 place count 127 transition count 486
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 363 place count 124 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 374 place count 124 transition count 492
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 381 place count 124 transition count 485
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 388 place count 117 transition count 485
Free-agglomeration rule (complex) applied 12 times with reduction of 8 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 400 place count 117 transition count 543
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 416 place count 105 transition count 539
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 427 place count 105 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 428 place count 104 transition count 538
Applied a total of 428 rules in 495 ms. Remains 104 /307 variables (removed 203) and now considering 538/740 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 104/307 places, 538/740 transitions.
RANDOM walk for 40000 steps (2589 resets) in 1491 ms. (26 steps per ms) remains 5/7 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (345 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (310 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (447 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (278 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (431 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
// Phase 1: matrix 538 rows 104 cols
[2024-06-03 04:04:49] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 04:04:49] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/89 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/91 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 532/623 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 108/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 19/642 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/642 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/642 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 104/104 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/89 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/91 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 532/623 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 108/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/623 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 19/642 variables, 13/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/642 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/642 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/642 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/642 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/642 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 244 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 104/104 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2466ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5579 ms.
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 538/538 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 537
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 536
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 101 transition count 538
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 100 transition count 529
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 100 transition count 529
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 99 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 99 transition count 525
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 97 transition count 523
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 96 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 96 transition count 520
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 96 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 95 transition count 519
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 95 transition count 521
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 25 place count 92 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 92 transition count 519
Applied a total of 26 rules in 81 ms. Remains 92 /104 variables (removed 12) and now considering 519/538 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 92/104 places, 519/538 transitions.
RANDOM walk for 40000 steps (2583 resets) in 307 ms. (129 steps per ms) remains 2/4 properties
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (307 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (443 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
// Phase 1: matrix 519 rows 92 cols
[2024-06-03 04:04:57] [INFO ] Computed 23 invariants in 3 ms
[2024-06-03 04:04:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 46/75 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 513/592 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 108/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/611 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/611 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 92/92 constraints, ReadFeed: 112/112 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/75 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/77 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 513/592 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 108/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/611 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/611 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/611 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/611 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/611 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 611/611 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 92/92 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 303 ms.
Support contains 15 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 519/519 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 91 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 90 transition count 565
Applied a total of 4 rules in 53 ms. Remains 90 /92 variables (removed 2) and now considering 565/519 (removed -46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 90/92 places, 565/519 transitions.
RANDOM walk for 40000 steps (2609 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (305 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (448 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 549662 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 2
Probabilistic random walk after 549662 steps, saw 105640 distinct states, run finished after 3009 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 565 rows 90 cols
[2024-06-03 04:05:02] [INFO ] Computed 23 invariants in 4 ms
[2024-06-03 04:05:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/71 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/73 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/77 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 559/636 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 108/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/655 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/655 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/655 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/655 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/655 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 112/112 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/71 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/73 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/77 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 559/636 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 108/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 19/655 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/655 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/655 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/655 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/655 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/655 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1932ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 152 ms.
Support contains 13 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 565/565 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 564
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 88 transition count 557
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 88 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 88 transition count 628
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 86 transition count 628
Applied a total of 8 rules in 44 ms. Remains 86 /90 variables (removed 4) and now considering 628/565 (removed -63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 86/90 places, 628/565 transitions.
RANDOM walk for 40000 steps (2738 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (338 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 762089 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :0 out of 1
Probabilistic random walk after 762089 steps, saw 148519 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
// Phase 1: matrix 628 rows 86 cols
[2024-06-03 04:05:08] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 04:05:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/67 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 622/695 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/695 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/714 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/714 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/67 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/73 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 622/695 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/695 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/714 variables, 13/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/714 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/714 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 105 ms.
Support contains 13 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 628/628 transitions.
Applied a total of 0 rules in 17 ms. Remains 86 /86 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 86/86 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 628/628 transitions.
Applied a total of 0 rules in 17 ms. Remains 86 /86 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-06-03 04:05:09] [INFO ] Invariant cache hit.
[2024-06-03 04:05:09] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-03 04:05:09] [INFO ] Invariant cache hit.
[2024-06-03 04:05:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-03 04:05:10] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-06-03 04:05:10] [INFO ] Redundant transitions in 40 ms returned []
Running 621 sub problems to find dead transitions.
[2024-06-03 04:05:10] [INFO ] Invariant cache hit.
[2024-06-03 04:05:10] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 24 solved, 597 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/16 constraints. Problems are: Problem set: 24 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 24 solved, 597 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/83 variables, 4/20 constraints. Problems are: Problem set: 72 solved, 549 unsolved
[2024-06-03 04:05:20] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-03 04:05:20] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/22 constraints. Problems are: Problem set: 72 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/22 constraints. Problems are: Problem set: 72 solved, 549 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/86 variables, 3/25 constraints. Problems are: Problem set: 144 solved, 477 unsolved
[2024-06-03 04:05:28] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 5 ms to minimize.
[2024-06-03 04:05:28] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2024-06-03 04:05:29] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 2 ms to minimize.
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
[2024-06-03 04:05:31] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 2 ms to minimize.
Problem TDEAD564 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD624 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 4/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 9 (OVERLAPS) 628/714 variables, 86/115 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 112/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/714 variables, and 227 constraints, problems are : Problem set: 174 solved, 447 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 174 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 11/16 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/18 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 2/83 variables, 4/22 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/23 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 3/86 variables, 3/26 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 3/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 10 (OVERLAPS) 628/714 variables, 86/115 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 112/227 constraints. Problems are: Problem set: 174 solved, 447 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 447/674 constraints. Problems are: Problem set: 174 solved, 447 unsolved
[2024-06-03 04:06:05] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-06-03 04:06:05] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2024-06-03 04:06:05] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-03 04:06:06] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 678 constraints, problems are : Problem set: 174 solved, 447 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 447/621 constraints, Known Traps: 10/10 constraints]
After SMT, in 63903ms problems are : Problem set: 174 solved, 447 unsolved
Search for dead transitions found 174 dead transitions in 63917ms
Found 174 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 174 transitions
Dead transitions reduction (with SMT) removed 174 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/86 places, 454/628 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 454
Applied a total of 1 rules in 16 ms. Remains 85 /86 variables (removed 1) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 85 cols
[2024-06-03 04:06:14] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 04:06:14] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-03 04:06:14] [INFO ] Invariant cache hit.
[2024-06-03 04:06:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 04:06:14] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/86 places, 454/628 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65236 ms. Remains : 85/86 places, 454/628 transitions.
RANDOM walk for 40000 steps (2746 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1089581 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1089581 steps, saw 217341 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
[2024-06-03 04:06:17] [INFO ] Invariant cache hit.
[2024-06-03 04:06:17] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/45 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/70 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 448/520 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/539 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/539 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/45 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/70 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/520 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/539 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/539 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/539 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 539/539 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 13 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 85/85 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-03 04:06:18] [INFO ] Invariant cache hit.
[2024-06-03 04:06:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-03 04:06:18] [INFO ] Invariant cache hit.
[2024-06-03 04:06:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-03 04:06:18] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-03 04:06:18] [INFO ] Redundant transitions in 6 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-03 04:06:18] [INFO ] Invariant cache hit.
[2024-06-03 04:06:18] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-03 04:06:22] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 3/83 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-03 04:06:27] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-06-03 04:06:28] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-06-03 04:06:28] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 2/85 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-03 04:06:33] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 10 (OVERLAPS) 454/539 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 24/136 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/539 variables, and 136 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 3/83 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (OVERLAPS) 2/85 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 10 (OVERLAPS) 454/539 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 24/136 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 447/583 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-03 04:07:06] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-03 04:07:06] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 585 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 7/7 constraints]
After SMT, in 61538ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 61545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62008 ms. Remains : 85/85 places, 454/454 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 607 edges and 85 vertex of which 81 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 81 transition count 443
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 80 transition count 419
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 80 transition count 419
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 79 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 79 transition count 416
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 79 transition count 416
Applied a total of 20 rules in 21 ms. Remains 79 /85 variables (removed 6) and now considering 416/454 (removed 38) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 79 cols
[2024-06-03 04:07:20] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 04:07:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 04:07:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-03 04:07:20] [INFO ] [Nat]Absence check using 11 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-03 04:07:20] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 04:07:20] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 04:07:20] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 643 ms.
[2024-06-03 04:07:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-03 04:07:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 454 transitions and 2986 arcs took 11 ms.
[2024-06-03 04:07:21] [INFO ] Flatten gal took : 138 ms
Total runtime 163993 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MedleyA-PT-22
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 85
TRANSITIONS: 454
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.010s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 710
MODEL NAME: /home/mcc/execution/415/model
85 places, 454 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.
Building monolithic NSF...
FORMULA MedleyA-PT-22-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717387647952
--------------------
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
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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r575-smll-171734919800175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 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 ;