MCC'2024- Execution of r536-tall-171690532800637

About the Execution of LTSMin+red for Sudoku-PT-AN09

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2552.027	227869.00	265440.00	596.30	? 81 81 81 ? 81 81 81 1 1 1 1 1 1 1 1	normal

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.r536-tall-171690532800637.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 Sudoku-PT-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532800637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 237K Apr 12 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 769K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 205K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 691K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 367K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 549K Apr 12 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 416K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717272369158

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:06:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 20:06:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:06:10] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-06-01 20:06:10] [INFO ] Transformed 972 places.
[2024-06-01 20:06:10] [INFO ] Transformed 729 transitions.
[2024-06-01 20:06:10] [INFO ] Found NUPN structural information;
[2024-06-01 20:06:10] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 81, 81, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[729, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[729, 1, 1]
// Phase 1: matrix 729 rows 972 cols
[2024-06-01 20:06:10] [INFO ] Computed 243 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[729, 1, 1]
RANDOM walk for 10000 steps (141 resets) in 642 ms. (15 steps per ms)
FORMULA Sudoku-PT-AN09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 155 ms. (64 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[729]
[2024-06-01 20:06:11] [INFO ] Invariant cache hit.
[2024-06-01 20:06:12] [INFO ] [Real]Absence check using 243 positive place invariants in 219 ms returned sat
[2024-06-01 20:06:12] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-06-01 20:06:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 33 ms.
[2024-06-01 20:06:12] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 728 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 61 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 20:06:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[729]
RANDOM walk for 502791 steps (7134 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 326568 steps (20 resets) in 5007 ms. (65 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2024-06-01 20:06:48] [INFO ] Invariant cache hit.
[2024-06-01 20:06:48] [INFO ] [Real]Absence check using 243 positive place invariants in 204 ms returned sat
[2024-06-01 20:06:49] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-06-01 20:06:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 20:06:49] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :sat
Minimization took 5218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 30 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 20:06:54] [INFO ] Invariant cache hit.
[2024-06-01 20:06:56] [INFO ] Implicit Places using invariants in 1483 ms returned []
[2024-06-01 20:06:56] [INFO ] Invariant cache hit.
[2024-06-01 20:06:57] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2932 ms to find 0 implicit places.
[2024-06-01 20:06:57] [INFO ] Redundant transitions in 34 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3008 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 20:06:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[729]
RANDOM walk for 518798 steps (7366 resets) in 30001 ms. (17 steps per ms)
BEST_FIRST walk for 309122 steps (19 resets) in 5008 ms. (61 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2024-06-01 20:07:32] [INFO ] Invariant cache hit.
[2024-06-01 20:07:33] [INFO ] [Real]Absence check using 243 positive place invariants in 185 ms returned sat
[2024-06-01 20:07:33] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-06-01 20:07:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 20:07:33] [INFO ] Added : 0 causal constraints over 0 iterations in 112 ms. Result :sat
Minimization took 5244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 20:07:39] [INFO ] Invariant cache hit.
[2024-06-01 20:07:40] [INFO ] Implicit Places using invariants in 1415 ms returned []
[2024-06-01 20:07:40] [INFO ] Invariant cache hit.
[2024-06-01 20:07:42] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2024-06-01 20:07:42] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2963 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (567 resets) in 4669 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 906 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1176 ms. (33 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 155413 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 155413 steps, saw 57368 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 20:07:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 890 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2145 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3551ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3118 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1071 ms. (37 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302721 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302721 steps, saw 81855 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-06-01 20:07:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1067 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8577 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9773ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 8 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[76] Max Struct:[729]
Starting property specific reduction for Sudoku-PT-AN09-UpperBounds-00
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[729]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[729]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[729]
[2024-06-01 20:08:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[729]
RANDOM walk for 10000 steps (142 resets) in 579 ms. (17 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 145 ms. (68 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[729]
[2024-06-01 20:08:05] [INFO ] Invariant cache hit.
[2024-06-01 20:08:05] [INFO ] [Real]Absence check using 243 positive place invariants in 194 ms returned sat
[2024-06-01 20:08:06] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-06-01 20:08:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 20:08:06] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Minimization took 635 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 20:08:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[729]
RANDOM walk for 528799 steps (7504 resets) in 30001 ms. (17 steps per ms)
BEST_FIRST walk for 320323 steps (20 resets) in 5005 ms. (63 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2024-06-01 20:08:42] [INFO ] Invariant cache hit.
[2024-06-01 20:08:42] [INFO ] [Real]Absence check using 243 positive place invariants in 187 ms returned sat
[2024-06-01 20:08:42] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 20:08:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 20:08:42] [INFO ] Added : 0 causal constraints over 0 iterations in 97 ms. Result :sat
Minimization took 5174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 20:08:48] [INFO ] Invariant cache hit.
[2024-06-01 20:08:49] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-06-01 20:08:49] [INFO ] Invariant cache hit.
[2024-06-01 20:08:51] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
[2024-06-01 20:08:51] [INFO ] Redundant transitions in 9 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2917 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 20:08:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[729]
RANDOM walk for 530142 steps (7522 resets) in 30001 ms. (17 steps per ms)
BEST_FIRST walk for 329796 steps (20 resets) in 5002 ms. (65 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2024-06-01 20:09:26] [INFO ] Invariant cache hit.
[2024-06-01 20:09:26] [INFO ] [Real]Absence check using 243 positive place invariants in 188 ms returned sat
[2024-06-01 20:09:26] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-06-01 20:09:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 20:09:27] [INFO ] Added : 0 causal constraints over 0 iterations in 106 ms. Result :sat
Minimization took 5159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 20:09:32] [INFO ] Invariant cache hit.
[2024-06-01 20:09:33] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2024-06-01 20:09:33] [INFO ] Invariant cache hit.
[2024-06-01 20:09:35] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2862 ms to find 0 implicit places.
[2024-06-01 20:09:35] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2888 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (567 resets) in 3774 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 816 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1088 ms. (36 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 182038 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 182038 steps, saw 61939 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-01 20:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 757 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2064 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3066ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2436 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 787 ms. (50 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 352034 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 352034 steps, saw 89768 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-06-01 20:09:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 976 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8470 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9602ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 10 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[76] Max Struct:[729]
Ending property specific reduction for Sudoku-PT-AN09-UpperBounds-00 in 111705 ms.
[2024-06-01 20:09:56] [INFO ] Flatten gal took : 116 ms
[2024-06-01 20:09:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 20:09:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 972 places, 729 transitions and 2916 arcs took 15 ms.
Total runtime 226502 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Sudoku-PT-AN09-UpperBounds-00

BK_STOP 1717272597027

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Sudoku-PT-AN09-UpperBounds-00
ub formula formula --maxsum=/tmp/614/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Sudoku-PT-AN09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 Sudoku-PT-AN09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532800637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN09.tgz
mv Sudoku-PT-AN09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;