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.r522-tall-171662354200548.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 ltsminxred
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 r522-tall-171662354200548
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:53:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 06:53:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:53:35] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 06:53:35] [INFO ] Transformed 200 places.
[2024-06-01 06:53:35] [INFO ] Transformed 102 transitions.
[2024-06-01 06:53:35] [INFO ] Found NUPN structural information;
[2024-06-01 06:53:35] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 176 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 6 ms.
RANDOM walk for 40000 steps (58 resets) in 1667 ms. (23 steps per ms) remains 47/198 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
// Phase 1: matrix 102 rows 200 cols
[2024-06-01 06:53:36] [INFO ] Computed 100 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 62/109 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 15/124 variables, 15/171 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 66/190 variables, 124/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 12/202 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (OVERLAPS) 12/214 variables, 8/338 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (OVERLAPS) 12/226 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 8/366 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/226 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 23 (OVERLAPS) 12/238 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 8/386 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/238 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 27 (OVERLAPS) 12/250 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/250 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/250 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/250 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 31 (OVERLAPS) 12/262 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/262 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/262 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/262 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 35 (OVERLAPS) 12/274 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/274 variables, 8/446 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/274 variables, 4/450 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/274 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 39 (OVERLAPS) 12/286 variables, 8/458 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/286 variables, 8/466 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/286 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/286 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 43 (OVERLAPS) 12/298 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/298 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/298 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/298 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 47 (OVERLAPS) 4/302 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/302 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/302 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 51 (OVERLAPS) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 500 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4009 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 62/109 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 15/124 variables, 15/171 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 66/190 variables, 124/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 44/354 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 12/202 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 17 (OVERLAPS) 12/214 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 21 (OVERLAPS) 12/226 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/226 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/226 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/226 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 25 (OVERLAPS) 12/238 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/238 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/238 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/302 variables, and 437 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5010 ms.
Refiners :[Domain max(s): 156/200 constraints, Positive P Invariants (semi-flows): 78/100 constraints, State Equation: 156/200 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 9083ms problems are : Problem set: 0 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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 46 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 54 ms. Remains : 197/200 places, 100/102 transitions.
RANDOM walk for 4000000 steps (6525 resets) in 25881 ms. (154 steps per ms) remains 35/47 properties
BEST_FIRST walk for 400004 steps (66 resets) in 988 ms. (404 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 679 ms. (588 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 671 ms. (595 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 672 ms. (594 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (65 resets) in 675 ms. (591 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 674 ms. (592 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (64 resets) in 677 ms. (589 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (65 resets) in 676 ms. (590 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (64 resets) in 679 ms. (588 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 675 ms. (591 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 675 ms. (591 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (64 resets) in 684 ms. (583 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (65 resets) in 683 ms. (584 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (64 resets) in 677 ms. (589 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (65 resets) in 670 ms. (596 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 673 ms. (593 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 670 ms. (596 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 676 ms. (590 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 679 ms. (588 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 676 ms. (590 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (64 resets) in 673 ms. (593 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 676 ms. (590 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (66 resets) in 673 ms. (593 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (65 resets) in 673 ms. (593 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 679 ms. (588 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (64 resets) in 676 ms. (590 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (64 resets) in 668 ms. (597 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (64 resets) in 669 ms. (597 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (64 resets) in 669 ms. (597 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (64 resets) in 670 ms. (596 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (64 resets) in 675 ms. (591 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (65 resets) in 675 ms. (591 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (65 resets) in 676 ms. (590 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (64 resets) in 677 ms. (589 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (64 resets) in 669 ms. (597 steps per ms) remains 34/34 properties
// Phase 1: matrix 100 rows 197 cols
[2024-06-01 06:53:59] [INFO ] Computed 99 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 44/78 variables, 23/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 44/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 11/89 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 48/137 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 12/149 variables, 8/231 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 12/161 variables, 8/251 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 8/259 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (OVERLAPS) 12/173 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/173 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/173 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 23 (OVERLAPS) 12/185 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/185 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/185 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/185 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 27 (OVERLAPS) 12/197 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/197 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/197 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 31 (OVERLAPS) 12/209 variables, 8/331 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/209 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/209 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/209 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 35 (OVERLAPS) 12/221 variables, 8/351 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/221 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/221 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/221 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 39 (OVERLAPS) 12/233 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/233 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/233 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/233 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 43 (OVERLAPS) 12/245 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/245 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/245 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/245 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 47 (OVERLAPS) 12/257 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/257 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/257 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/257 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 51 (OVERLAPS) 12/269 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/269 variables, 8/439 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/269 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/269 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 55 (OVERLAPS) 12/281 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/281 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/281 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/281 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 59 (OVERLAPS) 12/293 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/293 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/293 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/293 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 63 (OVERLAPS) 4/297 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/297 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/297 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 67 (OVERLAPS) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 493 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2867 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 44/78 variables, 23/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 44/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 11/89 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 48/137 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 31/254 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 12/149 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/149 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/149 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (OVERLAPS) 12/161 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/161 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 23 (OVERLAPS) 12/173 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/173 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/173 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/173 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 27 (OVERLAPS) 12/185 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/185 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/185 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/185 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 31 (OVERLAPS) 12/197 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/197 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/197 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/197 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 35 (OVERLAPS) 12/209 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/209 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/209 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/209 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 39 (OVERLAPS) 12/221 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/221 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/221 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/221 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 43 (OVERLAPS) 12/233 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/233 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/233 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/233 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 47 (OVERLAPS) 12/245 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/245 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/245 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/245 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 51 (OVERLAPS) 12/257 variables, 8/447 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/257 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/257 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/257 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 55 (OVERLAPS) 12/269 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/269 variables, 8/475 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/269 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/269 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 59 (OVERLAPS) 12/281 variables, 8/487 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/281 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/281 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/281 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 63 (OVERLAPS) 12/293 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/293 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/293 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/293 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 67 (OVERLAPS) 4/297 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/297 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/297 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/297 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 71 (OVERLAPS) 0/297 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 529 constraints, problems are : Problem set: 0 solved, 34 unsolved in 11093 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 2/2 constraints]
After SMT, in 13979ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 22 different solutions.
Finished Parikh walk after 47172 steps, including 142 resets, run visited all 12 properties in 833 ms. (steps per millisecond=56 )
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 34 properties in 971 ms.
Able to resolve query StableMarking after proving 199 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 38730 ms.
ITS solved all properties within timeout

BK_STOP 1717224854050

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R050C002"
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 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 r522-tall-171662354200548"
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 ;