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.r298-tajo-171654455000153.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 greatspnxred
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 r298-tajo-171654455000153
=====================================================================

--------------------
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 1717103760120

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:16:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:16:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:16:01] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-30 21:16:01] [INFO ] Transformed 536 places.
[2024-05-30 21:16:01] [INFO ] Transformed 1064 transitions.
[2024-05-30 21:16:01] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 261 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (11 resets) in 2325 ms. (17 steps per ms) remains 14/536 properties
BEST_FIRST walk for 40001 steps (11 resets) in 409 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (9 resets) in 347 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 330 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (11 resets) in 226 ms. (176 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 296 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 317 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 148 ms. (268 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
[2024-05-30 21:16:03] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-30 21:16:03] [INFO ] Computed 50 invariants in 55 ms
[2024-05-30 21:16:03] [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 2651 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-05-30 21:16:07] [INFO ] Deduced a trap composed of 142 places in 254 ms of which 35 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-05-30 21:16:07] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 74 places in 44 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-05-30 21:16:08] [INFO ] Deduced a trap composed of 284 places in 249 ms of which 4 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 239 places in 201 ms of which 4 ms to minimize.
[2024-05-30 21:16:09] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:16:09] [INFO ] Deduced a trap composed of 252 places in 291 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 21:16:10] [INFO ] Deduced a trap composed of 75 places in 61 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 5012 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 7788ms 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 283 ms. Remains 360 /536 variables (removed 176) and now considering 794/968 (removed 174) transitions.
Running 792 sub problems to find dead transitions.
[2024-05-30 21:16:11] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 360 cols
[2024-05-30 21:16:11] [INFO ] Computed 48 invariants in 38 ms
[2024-05-30 21:16:11] [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-05-30 21:16:18] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-30 21:16:18] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 114 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2024-05-30 21:16:24] [INFO ] Deduced a trap composed of 105 places in 192 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-05-30 21:16:28] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 2 ms to minimize.
[2024-05-30 21:16:29] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 2 ms to minimize.
[2024-05-30 21:16:29] [INFO ] Deduced a trap composed of 120 places in 165 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 20027 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-05-30 21:16:36] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 2 ms to minimize.
[2024-05-30 21:16:37] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:16:37] [INFO ] Deduced a trap composed of 204 places in 228 ms of which 3 ms to minimize.
[2024-05-30 21:16:38] [INFO ] Deduced a trap composed of 2 places in 96 ms of which 2 ms to minimize.
[2024-05-30 21:16:38] [INFO ] Deduced a trap composed of 108 places in 188 ms of which 2 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 194 places in 219 ms of which 3 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 4 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 200 places in 235 ms of which 3 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 197 places in 218 ms of which 3 ms to minimize.
[2024-05-30 21:16:41] [INFO ] Deduced a trap composed of 190 places in 213 ms of which 3 ms to minimize.
[2024-05-30 21:16:41] [INFO ] Deduced a trap composed of 180 places in 249 ms of which 3 ms to minimize.
[2024-05-30 21:16:41] [INFO ] Deduced a trap composed of 179 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:16:42] [INFO ] Deduced a trap composed of 187 places in 248 ms of which 4 ms to minimize.
[2024-05-30 21:16:42] [INFO ] Deduced a trap composed of 204 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:16:44] [INFO ] Deduced a trap composed of 201 places in 211 ms of which 3 ms to minimize.
[2024-05-30 21:16:44] [INFO ] Deduced a trap composed of 212 places in 193 ms of which 3 ms to minimize.
[2024-05-30 21:16:45] [INFO ] Deduced a trap composed of 201 places in 201 ms of which 2 ms to minimize.
[2024-05-30 21:16:45] [INFO ] Deduced a trap composed of 200 places in 176 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-05-30 21:16:49] [INFO ] Deduced a trap composed of 213 places in 219 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 20018 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 41740ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 41762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42073 ms. Remains : 360/536 places, 794/968 transitions.
RANDOM walk for 4000000 steps (2300 resets) in 27423 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (908 resets) in 11779 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (935 resets) in 12596 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (954 resets) in 11687 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (927 resets) in 12129 ms. (329 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (909 resets) in 11715 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (934 resets) in 11350 ms. (352 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (918 resets) in 11545 ms. (346 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000000 steps (993 resets) in 11251 ms. (355 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (950 resets) in 11692 ms. (342 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (907 resets) in 12025 ms. (332 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (959 resets) in 12438 ms. (321 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (980 resets) in 12158 ms. (328 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (960 resets) in 12064 ms. (331 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (956 resets) in 11781 ms. (339 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 5985244 steps, run timeout after 156007 ms. (steps per millisecond=38 ) properties seen :0 out of 14
Probabilistic random walk after 5985244 steps, saw 2763224 distinct states, run finished after 156015 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-30 21:20:21] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-30 21:20:21] [INFO ] Invariant cache hit.
[2024-05-30 21:20: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) 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 1858 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-05-30 21:20:24] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 2 ms to minimize.
[2024-05-30 21:20:24] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 3 ms to minimize.
[2024-05-30 21:20:25] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 3 ms to minimize.
[2024-05-30 21:20:25] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 2 ms to minimize.
[2024-05-30 21:20:25] [INFO ] Deduced a trap composed of 185 places in 202 ms of which 3 ms to minimize.
[2024-05-30 21:20:25] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 2 ms to minimize.
[2024-05-30 21:20:26] [INFO ] Deduced a trap composed of 145 places in 270 ms of which 5 ms to minimize.
[2024-05-30 21:20:26] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:20:26] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2024-05-30 21:20:26] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 3 ms to minimize.
[2024-05-30 21:20:27] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 3 ms to minimize.
[2024-05-30 21:20:27] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2024-05-30 21:20:27] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 2 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
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 72/490 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1142 variables, and 504 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 358/360 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 13/13 constraints]
After SMT, in 46921ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
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 27 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 27 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 19 ms. Remains 360 /360 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2024-05-30 21:21:08] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-30 21:21:08] [INFO ] Invariant cache hit.
[2024-05-30 21:21:09] [INFO ] Implicit Places using invariants in 810 ms returned [71, 78, 159, 169, 204, 337]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 827 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 31 ms. Remains 351 /354 variables (removed 3) and now considering 791/794 (removed 3) transitions.
[2024-05-30 21:21:09] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
// Phase 1: matrix 779 rows 351 cols
[2024-05-30 21:21:09] [INFO ] Computed 42 invariants in 15 ms
[2024-05-30 21:21:10] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-30 21:21:10] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-30 21:21:10] [INFO ] Invariant cache hit.
[2024-05-30 21:21:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-30 21:21:14] [INFO ] Implicit Places using invariants and state equation in 4226 ms returned []
Implicit Place search using SMT with State Equation took 4702 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 5580 ms. Remains : 351/360 places, 791/794 transitions.
RANDOM walk for 4000000 steps (2343 resets) in 40304 ms. (99 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3771156 steps (894 resets) in 16384 ms. (230 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (966 resets) in 16189 ms. (247 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3977799 steps (954 resets) in 16838 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3452195 steps (853 resets) in 16068 ms. (214 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3910399 steps (910 resets) in 16706 ms. (234 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (943 resets) in 14938 ms. (267 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3733311 steps (825 resets) in 15941 ms. (234 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3765522 steps (921 resets) in 16067 ms. (234 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (955 resets) in 15313 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (988 resets) in 15387 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3940268 steps (941 resets) in 14961 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000001 steps (934 resets) in 15031 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (962 resets) in 15414 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (986 resets) in 15198 ms. (263 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 10542537 steps, run timeout after 240001 ms. (steps per millisecond=43 ) properties seen :0 out of 14
Probabilistic random walk after 10542537 steps, saw 4431258 distinct states, run finished after 240002 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-30 21:26:34] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-30 21:26:34] [INFO ] Invariant cache hit.
[2024-05-30 21:26:34] [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 1411 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-05-30 21:26:36] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-30 21:26:36] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-30 21:26:36] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-30 21:26:37] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1128/1130 variables, and 480 constraints, problems are : Problem set: 0 solved, 14 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 349/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 76442ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
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 19 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 19 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 40 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2024-05-30 21:27:51] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-30 21:27:51] [INFO ] Invariant cache hit.
[2024-05-30 21:27:51] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-30 21:27:51] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-30 21:27:51] [INFO ] Invariant cache hit.
[2024-05-30 21:27:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-30 21:27:55] [INFO ] Implicit Places using invariants and state equation in 3523 ms returned []
Implicit Place search using SMT with State Equation took 3883 ms to find 0 implicit places.
[2024-05-30 21:27:55] [INFO ] Redundant transitions in 62 ms returned []
Running 789 sub problems to find dead transitions.
[2024-05-30 21:27:55] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2024-05-30 21:27:55] [INFO ] Invariant cache hit.
[2024-05-30 21:27:55] [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-05-30 21:28:00] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 3 ms to minimize.
[2024-05-30 21:28:00] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-30 21:28:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-30 21:28:00] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-30 21:28:00] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-30 21:28:01] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 3 ms to minimize.
[2024-05-30 21:28:01] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 2 ms to minimize.
[2024-05-30 21:28:01] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:28:02] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:28:02] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2024-05-30 21:28:04] [INFO ] Deduced a trap composed of 212 places in 186 ms of which 3 ms to minimize.
[2024-05-30 21:28:05] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:28:05] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 3 ms to minimize.
[2024-05-30 21:28:05] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 2 ms to minimize.
[2024-05-30 21:28:06] [INFO ] Deduced a trap composed of 129 places in 295 ms of which 6 ms to minimize.
[2024-05-30 21:28:06] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 3 ms to minimize.
[2024-05-30 21:28:06] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:28:07] [INFO ] Deduced a trap composed of 135 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:28:09] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-30 21:28:10] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 789 unsolved
[2024-05-30 21:28:21] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 61 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30021 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-05-30 21:28:47] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 3 ms to minimize.
[2024-05-30 21:28:54] [INFO ] Deduced a trap composed of 117 places in 190 ms of which 3 ms to minimize.
[2024-05-30 21:28:54] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-30 21:28:54] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/1130 variables, and 67 constraints, problems are : Problem set: 66 solved, 723 unsolved in 30022 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: 25/25 constraints]
After SMT, in 61199ms problems are : Problem set: 66 solved, 723 unsolved
Search for dead transitions found 66 dead transitions in 61217ms
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.3 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 0 ms
Applied a total of 1 rules in 18 ms. Remains 14 /351 variables (removed 337) and now considering 0/725 (removed 725) transitions.
[2024-05-30 21:28:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-30 21:28:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 21:28:56] [INFO ] Invariant cache hit.
[2024-05-30 21:28:56] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 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 65323 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 TOPOLOGICAL INITIAL_STATE
Total runtime 775326 ms.
ITS solved all properties within timeout

BK_STOP 1717104536800

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="greatspnxred"
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 greatspnxred"
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 r298-tajo-171654455000153"
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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;