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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 604K Apr 12 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Apr 12 11:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 308K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 810K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 393K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Apr 12 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29M Apr 12 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K 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 963K 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-AN12-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717273265365

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-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:21:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 20:21:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:21:06] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-06-01 20:21:06] [INFO ] Transformed 2160 places.
[2024-06-01 20:21:06] [INFO ] Transformed 1728 transitions.
[2024-06-01 20:21:06] [INFO ] Found NUPN structural information;
[2024-06-01 20:21:06] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 27 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[144, 0, 144, 144, 0, 1, 1, 1, 0, 1, 1, 1] Max Struct:[144, 1728, 144, 144, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-05 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-06 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-02 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-07 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-UpperBounds-00 144 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[1728, 1, 1]
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 20:21:06] [INFO ] Computed 432 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1728, 1, 1]
RANDOM walk for 10000 steps (79 resets) in 1539 ms. (6 steps per ms)
FORMULA Sudoku-PT-AN12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 431 ms. (23 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[130] Max Struct:[1728]
[2024-06-01 20:21:08] [INFO ] Invariant cache hit.
[2024-06-01 20:21:09] [INFO ] [Real]Absence check using 432 positive place invariants in 299 ms returned sat
[2024-06-01 20:21:11] [INFO ] [Real]Absence check using state equation in 1987 ms returned sat
[2024-06-01 20:21:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 71 ms.
[2024-06-01 20:21:12] [INFO ] Added : 0 causal constraints over 0 iterations in 264 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[130] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[130] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 128 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-06-01 20:21:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[130] Max Struct:[1728]
RANDOM walk for 201507 steps (1599 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 136292 steps (2 resets) in 5004 ms. (27 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133] Max Struct:[1728]
[2024-06-01 20:21:48] [INFO ] Invariant cache hit.
[2024-06-01 20:21:49] [INFO ] [Real]Absence check using 432 positive place invariants in 585 ms returned sat
[2024-06-01 20:21:51] [INFO ] [Real]Absence check using state equation in 2491 ms returned sat
[2024-06-01 20:21:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 89 ms.
[2024-06-01 20:21:51] [INFO ] Added : 0 causal constraints over 0 iterations in 265 ms. Result :sat
Minimization took 5875 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 74 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 60 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:21:58] [INFO ] Invariant cache hit.
[2024-06-01 20:22:01] [INFO ] Implicit Places using invariants in 3722 ms returned []
[2024-06-01 20:22:01] [INFO ] Invariant cache hit.
[2024-06-01 20:22:06] [INFO ] Implicit Places using invariants and state equation in 4472 ms returned []
Implicit Place search using SMT with State Equation took 8197 ms to find 0 implicit places.
[2024-06-01 20:22:06] [INFO ] Redundant transitions in 79 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 8370 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-06-01 20:22:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[133] Max Struct:[1728]
RANDOM walk for 194953 steps (1545 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 124233 steps (1 resets) in 5010 ms. (24 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133] Max Struct:[1728]
[2024-06-01 20:22:41] [INFO ] Invariant cache hit.
[2024-06-01 20:22:42] [INFO ] [Real]Absence check using 432 positive place invariants in 623 ms returned sat
[2024-06-01 20:22:44] [INFO ] [Real]Absence check using state equation in 2460 ms returned sat
[2024-06-01 20:22:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 71 ms.
[2024-06-01 20:22:45] [INFO ] Added : 0 causal constraints over 0 iterations in 248 ms. Result :sat
Minimization took 5260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 47 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:22:50] [INFO ] Invariant cache hit.
[2024-06-01 20:22:54] [INFO ] Implicit Places using invariants in 3828 ms returned []
[2024-06-01 20:22:54] [INFO ] Invariant cache hit.
[2024-06-01 20:22:58] [INFO ] Implicit Places using invariants and state equation in 4544 ms returned []
Implicit Place search using SMT with State Equation took 8382 ms to find 0 implicit places.
[2024-06-01 20:22:59] [INFO ] Redundant transitions in 86 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 8517 ms. Remains : 2160/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 8651 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2159 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1752 ms. (22 steps per ms) remains 2/2 properties
Probabilistic random walk after 139330 steps, saw 111866 distinct states, run finished after 9051 ms. (steps per millisecond=15 ) properties seen :0
[2024-06-01 20:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2092 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 2160 constraints, problems are : Problem set: 1 solved, 1 unsolved in 998 ms.
Refiners :[Domain max(s): 1728/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3690ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 30 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2160/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (314 resets) in 6670 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1963 ms. (20 steps per ms) remains 1/1 properties
Probabilistic random walk after 145457 steps, saw 117988 distinct states, run finished after 6042 ms. (steps per millisecond=24 ) properties seen :0
[2024-06-01 20:23:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3187 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2188 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5565ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 134 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 23 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[133] Max Struct:[1728]
Starting property specific reduction for Sudoku-PT-AN12-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1728]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1728]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1728]
[2024-06-01 20:23:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1728]
RANDOM walk for 10000 steps (79 resets) in 1548 ms. (6 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 362 ms. (27 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[130] Max Struct:[1728]
[2024-06-01 20:23:31] [INFO ] Invariant cache hit.
[2024-06-01 20:23:31] [INFO ] [Real]Absence check using 432 positive place invariants in 298 ms returned sat
[2024-06-01 20:23:33] [INFO ] [Real]Absence check using state equation in 1967 ms returned sat
[2024-06-01 20:23:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2024-06-01 20:23:34] [INFO ] Added : 0 causal constraints over 0 iterations in 210 ms. Result :sat
Minimization took 548 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[130] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[130] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-06-01 20:23:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[130] Max Struct:[1728]
RANDOM walk for 195094 steps (1546 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 140703 steps (2 resets) in 5007 ms. (28 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133] Max Struct:[1728]
[2024-06-01 20:24:09] [INFO ] Invariant cache hit.
[2024-06-01 20:24:10] [INFO ] [Real]Absence check using 432 positive place invariants in 589 ms returned sat
[2024-06-01 20:24:12] [INFO ] [Real]Absence check using state equation in 2277 ms returned sat
[2024-06-01 20:24:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 63 ms.
[2024-06-01 20:24:13] [INFO ] Added : 0 causal constraints over 0 iterations in 268 ms. Result :sat
Minimization took 5142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 26 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:24:18] [INFO ] Invariant cache hit.
[2024-06-01 20:24:22] [INFO ] Implicit Places using invariants in 3982 ms returned []
[2024-06-01 20:24:22] [INFO ] Invariant cache hit.
[2024-06-01 20:24:27] [INFO ] Implicit Places using invariants and state equation in 4757 ms returned []
Implicit Place search using SMT with State Equation took 8752 ms to find 0 implicit places.
[2024-06-01 20:24:27] [INFO ] Redundant transitions in 27 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 8813 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-06-01 20:24:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[133] Max Struct:[1728]
RANDOM walk for 194261 steps (1541 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 141037 steps (2 resets) in 5007 ms. (28 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[133] Max Struct:[1728]
[2024-06-01 20:25:02] [INFO ] Invariant cache hit.
[2024-06-01 20:25:03] [INFO ] [Real]Absence check using 432 positive place invariants in 631 ms returned sat
[2024-06-01 20:25:05] [INFO ] [Real]Absence check using state equation in 2476 ms returned sat
[2024-06-01 20:25:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 67 ms.
[2024-06-01 20:25:06] [INFO ] Added : 0 causal constraints over 0 iterations in 202 ms. Result :sat
Minimization took 5749 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[133] Max Struct:[1728]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[133] Max Struct:[1728]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:25:12] [INFO ] Invariant cache hit.
[2024-06-01 20:25:15] [INFO ] Implicit Places using invariants in 3828 ms returned []
[2024-06-01 20:25:15] [INFO ] Invariant cache hit.
[2024-06-01 20:25:20] [INFO ] Implicit Places using invariants and state equation in 4729 ms returned []
Implicit Place search using SMT with State Equation took 8560 ms to find 0 implicit places.
[2024-06-01 20:25:20] [INFO ] Redundant transitions in 34 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 8637 ms. Remains : 2160/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 7196 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1576 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1635 ms. (24 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 110412 steps, run timeout after 6001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 110412 steps, saw 90414 distinct states, run finished after 6016 ms. (steps per millisecond=18 ) properties seen :0
[2024-06-01 20:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2025 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 2160 constraints, problems are : Problem set: 1 solved, 1 unsolved in 944 ms.
Refiners :[Domain max(s): 1728/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3255ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 35 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2160/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 7737 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2158 ms. (18 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 185441 steps, run timeout after 6001 ms. (steps per millisecond=30 ) properties seen :0 out of 1
Probabilistic random walk after 185441 steps, saw 157897 distinct states, run finished after 6001 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 20:25:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3665 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 1728/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 432/2160 variables, 432/2160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2160 variables, 432/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/2592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/3888 variables, 2160/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3888 variables, 0/4752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3888/3888 variables, and 4752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2250 ms.
Refiners :[Domain max(s): 2160/2160 constraints, Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 2160/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6108ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 134 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 8 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[133] Max Struct:[1728]
Ending property specific reduction for Sudoku-PT-AN12-UpperBounds-01 in 138506 ms.
[2024-06-01 20:25:48] [INFO ] Flatten gal took : 200 ms
[2024-06-01 20:25:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 20:25:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 12 ms.
Total runtime 281633 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-AN12-UpperBounds-01

BK_STOP 1717273548342

--------------------
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-AN12-UpperBounds-01
ub formula formula --maxsum=/tmp/617/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-AN12"
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-AN12, 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-171690532900661"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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