Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r320-tall-171662353000548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ResAllocation-PT-R050C002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662353000548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K 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 1716769203132

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:20:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-27 00:20:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:20:04] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-27 00:20:04] [INFO ] Transformed 200 places.
[2024-05-27 00:20:04] [INFO ] Transformed 102 transitions.
[2024-05-27 00:20:04] [INFO ] Found NUPN structural information;
[2024-05-27 00:20:04] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 186 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (60 resets) in 2786 ms. (14 steps per ms) remains 53/198 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 182 ms. (21 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
// Phase 1: matrix 102 rows 200 cols
[2024-05-27 00:20:05] [INFO ] Computed 100 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 68/121 variables, 34/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 15/136 variables, 15/189 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 72/208 variables, 136/340 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 12/220 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (OVERLAPS) 12/232 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 19 (OVERLAPS) 12/244 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/244 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/244 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 23 (OVERLAPS) 12/256 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/256 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/256 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/256 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 27 (OVERLAPS) 12/268 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/268 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/268 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/268 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 31 (OVERLAPS) 12/280 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/280 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/280 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/280 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 35 (OVERLAPS) 12/292 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/292 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/292 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/292 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 39 (OVERLAPS) 10/302 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/302 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/302 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 43 (OVERLAPS) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 500 constraints, problems are : Problem set: 0 solved, 53 unsolved in 4327 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 68/121 variables, 34/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 15/136 variables, 15/189 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 72/208 variables, 136/340 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 50/390 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-27 00:20:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 12/220 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-27 00:20:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-27 00:20:13] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-27 00:20:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-27 00:20:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/302 variables, and 426 constraints, problems are : Problem set: 0 solved, 53 unsolved in 5016 ms.
Refiners :[Domain max(s): 144/200 constraints, Positive P Invariants (semi-flows): 72/100 constraints, State Equation: 152/200 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
After SMT, in 9398ms problems are : Problem set: 0 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 102/102 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 197 transition count 100
Applied a total of 5 rules in 95 ms. Remains 197 /200 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 197/200 places, 100/102 transitions.
RANDOM walk for 4000000 steps (6516 resets) in 33918 ms. (117 steps per ms) remains 38/53 properties
BEST_FIRST walk for 400003 steps (64 resets) in 1199 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 861 ms. (464 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 685 ms. (583 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 677 ms. (589 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 669 ms. (597 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 681 ms. (586 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 657 ms. (607 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 665 ms. (600 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 665 ms. (600 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 666 ms. (599 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 665 ms. (600 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 661 ms. (604 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 655 ms. (609 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 667 ms. (598 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 655 ms. (609 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 660 ms. (605 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 683 ms. (584 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 681 ms. (586 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 679 ms. (588 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (64 resets) in 660 ms. (605 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 664 ms. (601 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 661 ms. (604 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 653 ms. (611 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 664 ms. (601 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 658 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 657 ms. (607 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 660 ms. (605 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 654 ms. (610 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (66 resets) in 658 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 659 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 661 ms. (604 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 662 ms. (603 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (65 resets) in 659 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 683 ms. (584 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 659 ms. (606 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (64 resets) in 664 ms. (601 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 671 ms. (595 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 666 ms. (599 steps per ms) remains 38/38 properties
// Phase 1: matrix 100 rows 197 cols
[2024-05-27 00:20:31] [INFO ] Computed 99 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 48/86 variables, 25/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 11/97 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 52/149 variables, 97/243 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 12/161 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 12/173 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (OVERLAPS) 12/185 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/185 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/185 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/185 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (OVERLAPS) 12/197 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/197 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/197 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/197 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 27 (OVERLAPS) 12/209 variables, 8/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/209 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/209 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/209 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 31 (OVERLAPS) 12/221 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/221 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/221 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/221 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 35 (OVERLAPS) 12/233 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/233 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/233 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/233 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 39 (OVERLAPS) 12/245 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/245 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/245 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/245 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 43 (OVERLAPS) 12/257 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/257 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/257 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/257 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 47 (OVERLAPS) 12/269 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/269 variables, 8/439 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/269 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/269 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 51 (OVERLAPS) 12/281 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/281 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/281 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/281 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 55 (OVERLAPS) 12/293 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/293 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/293 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/293 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 59 (OVERLAPS) 4/297 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/297 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/297 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 63 (OVERLAPS) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 493 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3274 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 48/86 variables, 25/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 11/97 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 52/149 variables, 97/243 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 35/278 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-27 00:20:35] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 23 ms to minimize.
[2024-05-27 00:20:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 12/161 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-27 00:20:36] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (OVERLAPS) 12/173 variables, 8/312 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/173 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/173 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (OVERLAPS) 12/185 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/185 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/185 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/185 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 27 (OVERLAPS) 12/197 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/197 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/197 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 31 (OVERLAPS) 12/209 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/209 variables, 8/380 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/209 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/209 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 35 (OVERLAPS) 12/221 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/221 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/221 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/221 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 39 (OVERLAPS) 12/233 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/233 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/233 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/233 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 43 (OVERLAPS) 12/245 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/245 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/245 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/245 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 47 (OVERLAPS) 12/257 variables, 8/452 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/257 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/257 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/257 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 51 (OVERLAPS) 12/269 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/269 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/269 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/269 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 55 (OVERLAPS) 12/281 variables, 8/492 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/281 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/281 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/281 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 59 (OVERLAPS) 12/293 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/293 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/293 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/293 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 63 (OVERLAPS) 4/297 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/297 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/297 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/297 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 67 (OVERLAPS) 0/297 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 534 constraints, problems are : Problem set: 0 solved, 38 unsolved in 13599 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 16897ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 24 different solutions.
Finished Parikh walk after 26508 steps, including 70 resets, run visited all 12 properties in 553 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 38 properties in 686 ms.
Able to resolve query StableMarking after proving 199 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 44662 ms.
ITS solved all properties within timeout

BK_STOP 1716769248967

--------------------
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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r320-tall-171662353000548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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