About the Execution of GreatSPN+red for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9840.039 | 159269.00 | 568035.00 | 135.00 | TFF?TT?TFTTFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300551.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 DoubleExponent-PT-004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300551
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2023-03
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-05
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2023-06
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-09
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-11
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-12
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-14
FORMULA_NAME DoubleExponent-PT-004-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716376959159
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:22:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:22:40] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-22 11:22:40] [INFO ] Transformed 216 places.
[2024-05-22 11:22:40] [INFO ] Transformed 198 transitions.
[2024-05-22 11:22:40] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1325 resets) in 1554 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 199 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (107 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (108 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (112 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (105 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (103 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 204310 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :4 out of 16
Probabilistic random walk after 204310 steps, saw 102169 distinct states, run finished after 3006 ms. (steps per millisecond=67 ) properties seen :4
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 198 rows 216 cols
[2024-05-22 11:22:44] [INFO ] Computed 24 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-02 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-04 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-08 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-11 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-12 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 82/175 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem DoubleExponent-PT-004-ReachabilityFireability-2024-05 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 41/216 variables, 19/24 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 198/414 variables, 216/240 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 11:22:45] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 23 ms to minimize.
[2024-05-22 11:22:45] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-22 11:22:45] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:22:45] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 4/244 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/244 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/244 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 244 constraints, problems are : Problem set: 7 solved, 5 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 130/137 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/147 variables, 2/3 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 68/215 variables, 20/23 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 4/27 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 2 ms to minimize.
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:22:46] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 2 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 12/39 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/39 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/216 variables, 1/40 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 198/414 variables, 216/256 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/261 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:22:47] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 4/265 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/414 variables, 0/265 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/414 variables, 0/265 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 265 constraints, problems are : Problem set: 7 solved, 5 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 5/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 3465ms problems are : Problem set: 7 solved, 5 unsolved
Parikh walk visited 0 properties in 5833 ms.
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 209 transition count 155
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 168 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 166 transition count 153
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 90 place count 166 transition count 144
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 108 place count 157 transition count 144
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 184 place count 119 transition count 106
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 194 place count 114 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 114 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 113 transition count 105
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 212 place count 113 transition count 89
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 228 place count 97 transition count 89
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 242 place count 97 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 96 transition count 88
Applied a total of 243 rules in 75 ms. Remains 96 /216 variables (removed 120) and now considering 88/198 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 96/216 places, 88/198 transitions.
RANDOM walk for 40000 steps (5112 resets) in 426 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3417 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3378 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3344 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3326 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 504781 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :3 out of 5
Probabilistic random walk after 504781 steps, saw 253868 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :3
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 88 rows 96 cols
[2024-05-22 11:22:57] [INFO ] Computed 20 invariants in 16 ms
[2024-05-22 11:22:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/88 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:22:57] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 88/180 variables, 92/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/184 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/184 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/88 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-22 11:22:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/92 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 88/180 variables, 92/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/184 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/184 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/184 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 96/96 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 526 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 88/88 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 96 transition count 87
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 95 transition count 87
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 93 transition count 85
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 85
Applied a total of 8 rules in 27 ms. Remains 93 /96 variables (removed 3) and now considering 85/88 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 93/96 places, 85/88 transitions.
RANDOM walk for 40000 steps (5147 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3375 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3428 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 573518 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 2
Probabilistic random walk after 573518 steps, saw 288246 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 85 rows 93 cols
[2024-05-22 11:23:02] [INFO ] Computed 20 invariants in 9 ms
[2024-05-22 11:23:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/88 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 85/174 variables, 89/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/178 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 129 constraints, problems are : Problem set: 0 solved, 2 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/88 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:23:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 85/174 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/178 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/178 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 93/93 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-22 11:23:03] [INFO ] Invariant cache hit.
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants in 99 ms returned [20, 25, 40, 45, 61, 66, 84, 90]
[2024-05-22 11:23:03] [INFO ] Actually due to overlaps returned [66, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/93 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 84
Applied a total of 2 rules in 7 ms. Remains 90 /91 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 90 cols
[2024-05-22 11:23:03] [INFO ] Computed 18 invariants in 4 ms
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants in 90 ms returned [20, 25, 40, 45, 81, 87]
[2024-05-22 11:23:03] [INFO ] Actually due to overlaps returned [87, 81]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 88/93 places, 84/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 83
Applied a total of 2 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 87 cols
[2024-05-22 11:23:03] [INFO ] Computed 16 invariants in 3 ms
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants in 78 ms returned [20, 25, 40, 45]
[2024-05-22 11:23:03] [INFO ] Actually due to overlaps returned [25, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 85/93 places, 83/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 82
Applied a total of 2 rules in 7 ms. Remains 84 /85 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 84 cols
[2024-05-22 11:23:03] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants in 70 ms returned [37, 42]
[2024-05-22 11:23:03] [INFO ] Actually due to overlaps returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 83/93 places, 82/85 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 82 transition count 81
Applied a total of 2 rules in 5 ms. Remains 82 /83 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 11:23:03] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 11:23:03] [INFO ] Invariant cache hit.
[2024-05-22 11:23:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:23:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 82/93 places, 81/85 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 600 ms. Remains : 82/93 places, 81/85 transitions.
RANDOM walk for 40000 steps (5745 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3694 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 674835 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 2
Probabilistic random walk after 674835 steps, saw 338072 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2024-05-22 11:23:06] [INFO ] Invariant cache hit.
[2024-05-22 11:23:06] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/77 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/163 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/163 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 11:23:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/77 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 81/158 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/163 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/163 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 11:23:07] [INFO ] Invariant cache hit.
[2024-05-22 11:23:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:23:07] [INFO ] Invariant cache hit.
[2024-05-22 11:23:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 11:23:08] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-22 11:23:08] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 11:23:08] [INFO ] Invariant cache hit.
[2024-05-22 11:23:08] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:23:08] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:23:08] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
[2024-05-22 11:23:08] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 9 ms to minimize.
[2024-05-22 11:23:08] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/163 variables, 82/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 112 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/163 variables, 82/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 80/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:23:11] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 11:23:12] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/163 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 197 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 6266ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6490 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 77 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 74 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 74 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 18 place count 73 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 22 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 70 cols
[2024-05-22 11:23:14] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:23:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 11:23:14] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-22 11:23:14] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 11:23:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 11:23:14] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:23:14] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:23:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 11:23:14] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 11:23:14] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:23:14] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 11:23:14] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:23:14] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 342 ms.
[2024-05-22 11:23:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-22 11:23:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 81 transitions and 403 arcs took 4 ms.
[2024-05-22 11:23:14] [INFO ] Flatten gal took : 60 ms
Total runtime 34700 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleExponent-PT-004
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 81
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]
SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 791
MODEL NAME: /home/mcc/execution/406/model
82 places, 81 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 16 steps.
Creating all event NSFs..
Convergence in 16 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Convergence in 16 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 16 steps.
Creating all event NSFs..
Start RS construction.
Convergence in 39 steps.
Building monolithic NSF...
Start RS construction.
Convergence in 39 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 39 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 39 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 94 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 158 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 158 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 158 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 158 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 331 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 331 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 331 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 331 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 569 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 569 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 569 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 569 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 74 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2314 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2314 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1633 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2314 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2314 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1633 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1633 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1633 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716377118428
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r135-tall-171631131300551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 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 ;