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-171654455700143.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-S02J04T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K 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 717K 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 1717269543215

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-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:05] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-01 19:19:05] [INFO ] Transformed 614 places.
[2024-06-01 19:19:05] [INFO ] Transformed 1242 transitions.
[2024-06-01 19:19:05] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 441 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (11 resets) in 2684 ms. (14 steps per ms) remains 18/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 170 ms. (23 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 106 ms. (37 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (9 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
[2024-06-01 19:19:06] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-06-01 19:19:07] [INFO ] Computed 50 invariants in 152 ms
[2024-06-01 19:19:07] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 473/537 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/562 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 49/611 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/612 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1710 variables, 612/661 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1710 variables, 96/757 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1710 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1712 variables, 2/759 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1712 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 760 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3555 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 614/614 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 473/537 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 25/562 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 270 places in 461 ms of which 61 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 394 places in 410 ms of which 5 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 212 places in 5628 ms of which 17 ms to minimize.
SMT process timed out in 12270ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 402 place count 412 transition count 914
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 418 place count 412 transition count 898
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 434 place count 396 transition count 898
Applied a total of 434 rules in 351 ms. Remains 396 /614 variables (removed 218) and now considering 898/1114 (removed 216) transitions.
Running 896 sub problems to find dead transitions.
[2024-06-01 19:19:19] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
// Phase 1: matrix 882 rows 396 cols
[2024-06-01 19:19:19] [INFO ] Computed 48 invariants in 27 ms
[2024-06-01 19:19:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 2 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 14 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 4 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 142 places in 299 ms of which 3 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 3 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 218 places in 267 ms of which 3 ms to minimize.
[2024-06-01 19:19:33] [INFO ] Deduced a trap composed of 134 places in 271 ms of which 3 ms to minimize.
[2024-06-01 19:19:36] [INFO ] Deduced a trap composed of 143 places in 275 ms of which 3 ms to minimize.
[2024-06-01 19:19:36] [INFO ] Deduced a trap composed of 154 places in 260 ms of which 3 ms to minimize.
[2024-06-01 19:19:37] [INFO ] Deduced a trap composed of 168 places in 298 ms of which 2 ms to minimize.
[2024-06-01 19:19:37] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 5 ms to minimize.
[2024-06-01 19:19:38] [INFO ] Deduced a trap composed of 155 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:19:39] [INFO ] Deduced a trap composed of 205 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-06-01 19:19:40] [INFO ] Deduced a trap composed of 145 places in 264 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1278 variables, and 67 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 4 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 161 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1278 variables, and 69 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 23/23 constraints]
After SMT, in 42895ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 42927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43322 ms. Remains : 396/614 places, 898/1114 transitions.
RANDOM walk for 4000000 steps (1719 resets) in 60253 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (64 resets) in 2646 ms. (151 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (83 resets) in 2704 ms. (147 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (89 resets) in 2652 ms. (150 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (86 resets) in 2764 ms. (144 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (73 resets) in 2417 ms. (165 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (80 resets) in 2420 ms. (165 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (64 resets) in 2579 ms. (155 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (65 resets) in 2628 ms. (152 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (65 resets) in 2528 ms. (158 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (73 resets) in 2499 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (75 resets) in 2538 ms. (157 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (73 resets) in 2635 ms. (151 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (66 resets) in 2674 ms. (149 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 2600 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (61 resets) in 2470 ms. (161 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (55 resets) in 2445 ms. (163 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (85 resets) in 2459 ms. (162 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (64 resets) in 2461 ms. (162 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 3684724 steps, run timeout after 111001 ms. (steps per millisecond=33 ) properties seen :0 out of 18
Probabilistic random walk after 3684724 steps, saw 2063702 distinct states, run finished after 111014 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 19:22:30] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-06-01 19:22:30] [INFO ] Invariant cache hit.
[2024-06-01 19:22:30] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 238/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 57/313 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 16/329 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 64/393 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 882/1276 variables, 394/441 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1276 variables, 96/537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 2/1278 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1278 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1278 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/1278 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1278/1278 variables, and 540 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 396/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 238/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 57/313 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:22:42] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 16/329 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:22:45] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 64/393 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:22:46] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:22:47] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/394 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 882/1276 variables, 394/450 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1276 variables, 96/546 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1278 variables, and 564 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 394/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints]
After SMT, in 47057ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 55 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 396/396 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 41 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-06-01 19:23:18] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-06-01 19:23:18] [INFO ] Invariant cache hit.
[2024-06-01 19:23:18] [INFO ] Implicit Places using invariants in 679 ms returned [71, 117, 189, 197, 268, 311, 334, 341]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 689 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/396 places, 898/898 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 382 transition count 892
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 382 transition count 892
Applied a total of 12 rules in 41 ms. Remains 382 /388 variables (removed 6) and now considering 892/898 (removed 6) transitions.
[2024-06-01 19:23:18] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-06-01 19:23:18] [INFO ] Computed 40 invariants in 35 ms
[2024-06-01 19:23:19] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 19:23:19] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:23:19] [INFO ] Invariant cache hit.
[2024-06-01 19:23:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:23:25] [INFO ] Implicit Places using invariants and state equation in 5928 ms returned []
Implicit Place search using SMT with State Equation took 6508 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/396 places, 892/898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7280 ms. Remains : 382/396 places, 892/898 transitions.
RANDOM walk for 4000000 steps (1784 resets) in 30673 ms. (130 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (71 resets) in 1337 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (76 resets) in 1338 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (75 resets) in 1476 ms. (270 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (72 resets) in 1362 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 1299 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (65 resets) in 1410 ms. (283 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (73 resets) in 1339 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (81 resets) in 1307 ms. (305 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (82 resets) in 1482 ms. (269 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (67 resets) in 1340 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (72 resets) in 1326 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (72 resets) in 1440 ms. (277 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 1355 ms. (294 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (60 resets) in 1317 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (70 resets) in 1378 ms. (290 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (78 resets) in 1364 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (66 resets) in 1324 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (70 resets) in 1359 ms. (294 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1632508 steps, run timeout after 45001 ms. (steps per millisecond=36 ) properties seen :0 out of 18
Probabilistic random walk after 1632508 steps, saw 861007 distinct states, run finished after 45002 ms. (steps per millisecond=36 ) properties seen :0
[2024-06-01 19:24:25] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:24:25] [INFO ] Invariant cache hit.
[2024-06-01 19:24:25] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 261/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 21/300 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/308 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 68/376 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 3/379 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 876/1256 variables, 380/419 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1256 variables, 96/515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1256 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 2/1258 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1258 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/1258 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 518 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2277 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 261/279 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 21/300 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/308 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 68/376 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 4 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 2 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 194 places in 251 ms of which 3 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 2 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 151 places in 267 ms of which 3 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 181 places in 246 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 3/379 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/380 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 876/1256 variables, 380/430 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 96/526 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_528 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 64541ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2102 ms.
Support contains 18 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 45 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 27 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-06-01 19:25:32] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:25:32] [INFO ] Invariant cache hit.
[2024-06-01 19:25:40] [INFO ] Implicit Places using invariants in 8324 ms returned []
[2024-06-01 19:25:40] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:25:40] [INFO ] Invariant cache hit.
[2024-06-01 19:25:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:25:46] [INFO ] Implicit Places using invariants and state equation in 6013 ms returned []
Implicit Place search using SMT with State Equation took 14340 ms to find 0 implicit places.
[2024-06-01 19:25:46] [INFO ] Redundant transitions in 90 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-01 19:25:46] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:25:46] [INFO ] Invariant cache hit.
[2024-06-01 19:25:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 19:25:53] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2024-06-01 19:25:53] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 5 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:25:55] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2024-06-01 19:25:55] [INFO ] Deduced a trap composed of 66 places in 333 ms of which 18 ms to minimize.
[2024-06-01 19:25:56] [INFO ] Deduced a trap composed of 139 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:25:56] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 2 ms to minimize.
[2024-06-01 19:25:56] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 2 ms to minimize.
[2024-06-01 19:25:57] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 4 ms to minimize.
[2024-06-01 19:25:57] [INFO ] Deduced a trap composed of 218 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:25:58] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 2 ms to minimize.
[2024-06-01 19:26:01] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:26:02] [INFO ] Deduced a trap composed of 177 places in 240 ms of which 3 ms to minimize.
[2024-06-01 19:26:02] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 19:26:07] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:26:09] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:26:09] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:26:09] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:26:10] [INFO ] Deduced a trap composed of 181 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:26:10] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 3 ms to minimize.
[2024-06-01 19:26:10] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 65 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 19:26:42] [INFO ] Deduced a trap composed of 165 places in 271 ms of which 4 ms to minimize.
[2024-06-01 19:26:44] [INFO ] Deduced a trap composed of 183 places in 256 ms of which 3 ms to minimize.
[2024-06-01 19:26:44] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 68 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 30/30 constraints]
After SMT, in 61932ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 61946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76422 ms. Remains : 382/382 places, 892/892 transitions.
RANDOM walk for 400000 steps (182 resets) in 5299 ms. (75 steps per ms) remains 18/18 properties
Running SMT prover for 18 properties.
[2024-06-01 19:26:50] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 19:26:50] [INFO ] Invariant cache hit.
[2024-06-01 19:26:50] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 19:26:50] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 19:26:50] [INFO ] After 601ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16
[2024-06-01 19:26:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:26:51] [INFO ] After 246ms SMT Verify possible using 96 Read/Feed constraints in real domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2024-06-01 19:26:51] [INFO ] After 918ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:16
[2024-06-01 19:26:51] [INFO ] After 1634ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2024-06-01 19:26:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-06-01 19:26:51] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 23 ms returned sat
[2024-06-01 19:26:55] [INFO ] After 3182ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2024-06-01 19:26:57] [INFO ] After 2228ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 4 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 147 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 777 ms
TRAPS : Iteration 1
[2024-06-01 19:27:24] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 2 ms to minimize.
[2024-06-01 19:27:24] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
TRAPS : Iteration 2
[2024-06-01 19:27:25] [INFO ] After 30543ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
[2024-06-01 19:27:42] [INFO ] After 51057ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 517887 ms.
ITS solved all properties within timeout

BK_STOP 1717270062932

--------------------
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-S02J04T08"
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-S02J04T08, 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-171654455700143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 ;