About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1773.592 | 836273.00 | 1522818.00 | 137.70 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700153.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717269583134
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:44] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-01 19:19:44] [INFO ] Transformed 536 places.
[2024-06-01 19:19:44] [INFO ] Transformed 1064 transitions.
[2024-06-01 19:19:44] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 211 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40001 steps (16 resets) in 2708 ms. (14 steps per ms) remains 14/536 properties
BEST_FIRST walk for 40002 steps (10 resets) in 346 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 450 ms. (88 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (11 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 239 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (11 resets) in 309 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (9 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (11 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
[2024-06-01 19:19:46] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 19:19:46] [INFO ] Computed 50 invariants in 44 ms
[2024-06-01 19:19:46] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 36/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 350/400 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 63/463 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 70/533 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 956/1490 variables, 534/583 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1490 variables, 72/655 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1490 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1492 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 36/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 350/400 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 63/463 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/533 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 284 places in 196 ms of which 3 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 239 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 252 places in 174 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/534 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1492 variables, and 594 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 534/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 11/11 constraints]
After SMT, in 8101ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 480 transition count 854
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 326 place count 372 transition count 806
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 372 transition count 794
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 350 place count 360 transition count 794
Applied a total of 350 rules in 236 ms. Remains 360 /536 variables (removed 176) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2024-06-01 19:19:55] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 360 cols
[2024-06-01 19:19:55] [INFO ] Computed 48 invariants in 20 ms
[2024-06-01 19:19:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:20:06] [INFO ] Deduced a trap composed of 105 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 2 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 144 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:20:11] [INFO ] Deduced a trap composed of 120 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1142 variables, and 54 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 174 places in 191 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 204 places in 220 ms of which 3 ms to minimize.
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 3 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 194 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 194 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 200 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 197 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 190 places in 199 ms of which 3 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 3 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 187 places in 259 ms of which 3 ms to minimize.
[2024-06-01 19:20:25] [INFO ] Deduced a trap composed of 204 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:20:26] [INFO ] Deduced a trap composed of 201 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:20:27] [INFO ] Deduced a trap composed of 212 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:20:28] [INFO ] Deduced a trap composed of 201 places in 190 ms of which 2 ms to minimize.
[2024-06-01 19:20:28] [INFO ] Deduced a trap composed of 200 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 19:20:32] [INFO ] Deduced a trap composed of 213 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1142 variables, and 75 constraints, problems are : Problem set: 0 solved, 792 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/35 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 35/35 constraints]
After SMT, in 41495ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 41511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41775 ms. Remains : 360/536 places, 794/968 transitions.
RANDOM walk for 4000000 steps (2308 resets) in 27803 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (949 resets) in 11709 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (918 resets) in 11820 ms. (338 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (939 resets) in 11890 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (934 resets) in 11768 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (901 resets) in 11690 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (949 resets) in 12062 ms. (331 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (997 resets) in 11615 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000000 steps (942 resets) in 11660 ms. (343 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (919 resets) in 11773 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (926 resets) in 11747 ms. (340 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (941 resets) in 11799 ms. (338 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (972 resets) in 11969 ms. (334 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (909 resets) in 11865 ms. (337 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (966 resets) in 11560 ms. (345 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 6742566 steps, run timeout after 162001 ms. (steps per millisecond=41 ) properties seen :0 out of 14
Probabilistic random walk after 6742566 steps, saw 3088935 distinct states, run finished after 162009 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 19:24:13] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-06-01 19:24:13] [INFO ] Invariant cache hit.
[2024-06-01 19:24:13] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 171/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/219 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/221 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 132/353 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 5/358 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 782/1140 variables, 358/405 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1140 variables, 72/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1142 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1142 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1142 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1142 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 480 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 360/360 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 171/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 34/219 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/221 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 132/353 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 3 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 185 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 118 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 150 places in 194 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 5/358 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 782/1140 variables, 358/418 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 46773ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 28317 ms.
Support contains 14 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 23 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 360/360 places, 794/794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 794/794 transitions.
Applied a total of 0 rules in 21 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-06-01 19:25:28] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-06-01 19:25:28] [INFO ] Invariant cache hit.
[2024-06-01 19:25:28] [INFO ] Implicit Places using invariants in 550 ms returned [71, 78, 159, 169, 204, 337]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 559 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/360 places, 794/794 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 351 transition count 791
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 351 transition count 791
Applied a total of 6 rules in 41 ms. Remains 351 /354 variables (removed 3) and now considering 791/794 (removed 3) transitions.
[2024-06-01 19:25:29] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
// Phase 1: matrix 779 rows 351 cols
[2024-06-01 19:25:29] [INFO ] Computed 42 invariants in 15 ms
[2024-06-01 19:25:29] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 19:25:29] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 19:25:29] [INFO ] Invariant cache hit.
[2024-06-01 19:25:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:25:33] [INFO ] Implicit Places using invariants and state equation in 3721 ms returned []
Implicit Place search using SMT with State Equation took 4111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 351/360 places, 791/794 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4732 ms. Remains : 351/360 places, 791/794 transitions.
RANDOM walk for 4000000 steps (2328 resets) in 26765 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (906 resets) in 11303 ms. (353 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (906 resets) in 14331 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (956 resets) in 14745 ms. (271 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (866 resets) in 14531 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (948 resets) in 14931 ms. (267 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (892 resets) in 15018 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3980606 steps (930 resets) in 14376 ms. (276 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3985779 steps (934 resets) in 15055 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3763582 steps (882 resets) in 16136 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (941 resets) in 14923 ms. (268 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (979 resets) in 14619 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3992823 steps (931 resets) in 15161 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (989 resets) in 15998 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3964313 steps (921 resets) in 14362 ms. (276 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 8587935 steps, run timeout after 216001 ms. (steps per millisecond=39 ) properties seen :0 out of 14
Probabilistic random walk after 8587935 steps, saw 3673196 distinct states, run finished after 216002 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 19:30:21] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 19:30:21] [INFO ] Invariant cache hit.
[2024-06-01 19:30:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 212/226 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 30/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 90/346 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/348 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/349 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 779/1128 variables, 349/390 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1128 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/1130 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1130 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1130 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/1130 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 465 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 212/226 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 30/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 90/346 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:30:23] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:30:24] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:30:24] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:30:24] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/348 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 779/1128 variables, 349/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem smplace_362 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 39211ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 93156 ms.
Support contains 14 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 351/351 places, 791/791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 25 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2024-06-01 19:32:34] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 19:32:34] [INFO ] Invariant cache hit.
[2024-06-01 19:32:34] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 19:32:34] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 19:32:34] [INFO ] Invariant cache hit.
[2024-06-01 19:32:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:32:37] [INFO ] Implicit Places using invariants and state equation in 3422 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
[2024-06-01 19:32:38] [INFO ] Redundant transitions in 68 ms returned []
Running 789 sub problems to find dead transitions.
[2024-06-01 19:32:38] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-06-01 19:32:38] [INFO ] Invariant cache hit.
[2024-06-01 19:32:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-06-01 19:32:47] [INFO ] Deduced a trap composed of 212 places in 205 ms of which 2 ms to minimize.
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 2 ms to minimize.
[2024-06-01 19:32:48] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 2 ms to minimize.
[2024-06-01 19:32:49] [INFO ] Deduced a trap composed of 129 places in 238 ms of which 3 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 116 places in 217 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 2 ms to minimize.
[2024-06-01 19:32:50] [INFO ] Deduced a trap composed of 135 places in 224 ms of which 3 ms to minimize.
[2024-06-01 19:32:52] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 19:32:53] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-06-01 19:33:05] [INFO ] Deduced a trap composed of 134 places in 235 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 61 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/351 variables, 2/63 constraints. Problems are: Problem set: 66 solved, 723 unsolved
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 113 places in 233 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/1130 variables, and 64 constraints, problems are : Problem set: 66 solved, 723 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 22/22 constraints]
After SMT, in 61214ms problems are : Problem set: 66 solved, 723 unsolved
Search for dead transitions found 66 dead transitions in 61226ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/351 places, 725/791 transitions.
Reduce places removed 0 places and 12 transitions.
Graph (complete) has 2143 edges and 351 vertex of which 14 are kept as prefixes of interest. Removing 337 places using SCC suffix rule.2 ms
Discarding 337 places :
Also discarding 701 output transitions
Drop transitions (Output transitions of discarded places.) removed 701 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 12
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 14 places in 1 ms
Applied a total of 1 rules in 12 ms. Remains 14 /351 variables (removed 337) and now considering 0/725 (removed 725) transitions.
[2024-06-01 19:33:39] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 19:33:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 19:33:39] [INFO ] Invariant cache hit.
[2024-06-01 19:33:39] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/351 places, 0/791 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65152 ms. Remains : 14/351 places, 0/791 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 834856 ms.
ITS solved all properties within timeout
BK_STOP 1717270419407
--------------------
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 StableMarking -timeout 180 -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="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;