About the Execution of LTSMin+red for Sudoku-COL-AN15
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-171690532500525.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-COL-AN15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500525
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN15-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717264560014
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:56:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:56:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:56:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:56:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:56:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2024-06-01 17:56:01] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-06-01 17:56:01] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-06-01 17:56:01] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:56:01] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[225, 0, 225, 225] Max Struct:[225, 225, 225, 225]
FORMULA Sudoku-COL-AN15-UpperBounds-15 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-04 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-08 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-09 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-13 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-14 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-02 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-07 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN15-UpperBounds-00 225 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 17:56:01] [INFO ] Invariant cache hit.
[2024-06-01 17:56:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 17:56:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 17:56:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:56:01] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[225]
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-06-01 17:56:02] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 68 ms.
[2024-06-01 17:56:02] [INFO ] Unfolded 1 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
// Phase 1: matrix 3375 rows 4050 cols
[2024-06-01 17:56:02] [INFO ] Computed 675 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2965 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 798 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[203] Max Struct:[225]
[2024-06-01 17:56:05] [INFO ] Invariant cache hit.
[2024-06-01 17:56:07] [INFO ] [Real]Absence check using 675 positive place invariants in 1361 ms returned sat
[2024-06-01 17:56:10] [INFO ] [Real]Absence check using state equation in 3156 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[203] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[203] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 215 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:56:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[203] Max Struct:[225]
RANDOM walk for 103605 steps (521 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 64319 steps (0 resets) in 5062 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-06-01 17:56:46] [INFO ] Invariant cache hit.
[2024-06-01 17:56:48] [INFO ] [Real]Absence check using 675 positive place invariants in 1436 ms returned sat
[2024-06-01 17:57:08] [INFO ] [Real]Absence check using state equation in 20141 ms returned sat
[2024-06-01 17:57:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 269 ms.
[2024-06-01 17:57:09] [INFO ] Added : 0 causal constraints over 0 iterations in 674 ms. Result :sat
Minimization took 6359 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 171 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 191 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 17:57:16] [INFO ] Invariant cache hit.
[2024-06-01 17:57:18] [INFO ] Implicit Places using invariants in 2262 ms returned []
[2024-06-01 17:57:18] [INFO ] Invariant cache hit.
[2024-06-01 17:57:25] [INFO ] Implicit Places using invariants and state equation in 6790 ms returned []
Implicit Place search using SMT with State Equation took 9056 ms to find 0 implicit places.
[2024-06-01 17:57:25] [INFO ] Redundant transitions in 162 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 9431 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:57:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[205] Max Struct:[225]
RANDOM walk for 104057 steps (524 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 68440 steps (0 resets) in 5057 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[225]
[2024-06-01 17:58:00] [INFO ] Invariant cache hit.
[2024-06-01 17:58:02] [INFO ] [Real]Absence check using 675 positive place invariants in 1753 ms returned sat
[2024-06-01 17:58:40] [INFO ] [Real]Absence check using state equation in 37597 ms returned sat
[2024-06-01 17:58:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 123 ms.
[2024-06-01 17:58:41] [INFO ] Added : 0 causal constraints over 0 iterations in 405 ms. Result :sat
Minimization took 4541 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 67 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 92 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 17:58:45] [INFO ] Invariant cache hit.
[2024-06-01 17:58:48] [INFO ] Implicit Places using invariants in 2234 ms returned []
[2024-06-01 17:58:48] [INFO ] Invariant cache hit.
[2024-06-01 17:58:54] [INFO ] Implicit Places using invariants and state equation in 6495 ms returned []
Implicit Place search using SMT with State Equation took 8748 ms to find 0 implicit places.
[2024-06-01 17:58:54] [INFO ] Redundant transitions in 186 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 9048 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 17:58:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[207] Max Struct:[225]
RANDOM walk for 106057 steps (535 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 58182 steps (0 resets) in 5022 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[225]
[2024-06-01 17:59:29] [INFO ] Invariant cache hit.
[2024-06-01 17:59:32] [INFO ] [Real]Absence check using 675 positive place invariants in 1697 ms returned sat
[2024-06-01 18:00:09] [INFO ] [Real]Absence check using state equation in 37431 ms returned sat
[2024-06-01 18:00:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 125 ms.
[2024-06-01 18:00:10] [INFO ] Added : 0 causal constraints over 0 iterations in 432 ms. Result :sat
Minimization took 4692 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 124 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 113 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 18:00:15] [INFO ] Invariant cache hit.
[2024-06-01 18:00:17] [INFO ] Implicit Places using invariants in 2390 ms returned []
[2024-06-01 18:00:17] [INFO ] Invariant cache hit.
[2024-06-01 18:00:24] [INFO ] Implicit Places using invariants and state equation in 6856 ms returned []
Implicit Place search using SMT with State Equation took 9248 ms to find 0 implicit places.
[2024-06-01 18:00:24] [INFO ] Redundant transitions in 100 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 9475 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 18732 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3699 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3304 ms. (12 steps per ms) remains 2/2 properties
Probabilistic random walk after 196657 steps, saw 196586 distinct states, run finished after 21018 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 18:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4989 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8665ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 117 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 25761 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6947 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5981 ms. (6 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 278918 steps, run timeout after 30011 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 278918 steps, saw 278796 distinct states, run finished after 30015 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 18:01:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3375/7425 variables, 4050/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45038 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3375/7425 variables, 4050/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7425 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 44097 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90391ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2389 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 78 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[207] Max Struct:[225]
Starting property specific reduction for Sudoku-COL-AN15-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[225]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[225]
[2024-06-01 18:03:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[225]
RANDOM walk for 10000 steps (50 resets) in 2933 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 730 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[203] Max Struct:[225]
[2024-06-01 18:03:18] [INFO ] Invariant cache hit.
[2024-06-01 18:03:20] [INFO ] [Real]Absence check using 675 positive place invariants in 1301 ms returned sat
[2024-06-01 18:03:23] [INFO ] [Real]Absence check using state equation in 3334 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[203] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[203] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 80 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 18:03:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[203] Max Struct:[225]
RANDOM walk for 103959 steps (523 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 69673 steps (0 resets) in 5033 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-06-01 18:03:58] [INFO ] Invariant cache hit.
[2024-06-01 18:04:00] [INFO ] [Real]Absence check using 675 positive place invariants in 1480 ms returned sat
[2024-06-01 18:04:21] [INFO ] [Real]Absence check using state equation in 20586 ms returned sat
[2024-06-01 18:04:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 201 ms.
[2024-06-01 18:04:22] [INFO ] Added : 0 causal constraints over 0 iterations in 468 ms. Result :sat
Minimization took 4917 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 52 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 50 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 18:04:27] [INFO ] Invariant cache hit.
[2024-06-01 18:04:29] [INFO ] Implicit Places using invariants in 2492 ms returned []
[2024-06-01 18:04:29] [INFO ] Invariant cache hit.
[2024-06-01 18:04:36] [INFO ] Implicit Places using invariants and state equation in 6660 ms returned []
Implicit Place search using SMT with State Equation took 9154 ms to find 0 implicit places.
[2024-06-01 18:04:36] [INFO ] Redundant transitions in 99 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 9321 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-06-01 18:04:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[205] Max Struct:[225]
RANDOM walk for 103715 steps (523 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 69962 steps (0 resets) in 5011 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[225]
[2024-06-01 18:05:11] [INFO ] Invariant cache hit.
[2024-06-01 18:05:13] [INFO ] [Real]Absence check using 675 positive place invariants in 1479 ms returned sat
[2024-06-01 18:05:33] [INFO ] [Real]Absence check using state equation in 20290 ms returned sat
[2024-06-01 18:05:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 124 ms.
[2024-06-01 18:05:34] [INFO ] Added : 0 causal constraints over 0 iterations in 399 ms. Result :sat
Minimization took 4909 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[225]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[225]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 47 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 53 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 18:05:39] [INFO ] Invariant cache hit.
[2024-06-01 18:05:41] [INFO ] Implicit Places using invariants in 2249 ms returned []
[2024-06-01 18:05:41] [INFO ] Invariant cache hit.
[2024-06-01 18:05:48] [INFO ] Implicit Places using invariants and state equation in 6804 ms returned []
Implicit Place search using SMT with State Equation took 9093 ms to find 0 implicit places.
[2024-06-01 18:05:48] [INFO ] Redundant transitions in 98 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 9261 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 22345 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4561 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3673 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 227022 steps, saw 226937 distinct states, run finished after 24009 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 18:06:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 675/4050 variables, 675/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4050 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10555ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2199 ms.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 47 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 22492 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6543 ms. (6 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286913 steps, run timeout after 21007 ms. (steps per millisecond=13 ) properties seen :0 out of 1
Probabilistic random walk after 286913 steps, saw 286784 distinct states, run finished after 21008 ms. (steps per millisecond=13 ) properties seen :0
[2024-06-01 18:07:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9558 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 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/3375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9608 ms.
Refiners :[Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19550ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 60 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 56 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-06-01 18:07:22] [INFO ] Invariant cache hit.
[2024-06-01 18:07:24] [INFO ] Implicit Places using invariants in 2190 ms returned []
[2024-06-01 18:07:24] [INFO ] Invariant cache hit.
[2024-06-01 18:07:30] [INFO ] Implicit Places using invariants and state equation in 6562 ms returned []
Implicit Place search using SMT with State Equation took 8765 ms to find 0 implicit places.
[2024-06-01 18:07:31] [INFO ] Redundant transitions in 103 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 8935 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[205] Max Struct:[225]
Ending property specific reduction for Sudoku-COL-AN15-UpperBounds-01 in 255954 ms.
[2024-06-01 18:07:31] [INFO ] Flatten gal took : 677 ms
[2024-06-01 18:07:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 18:07:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 18 ms.
Total runtime 690882 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Sudoku-COL-AN15-UpperBounds-01
BK_STOP 1717265252215
--------------------
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-COL-AN15-UpperBounds-01
ub formula formula --maxsum=/tmp/662/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-COL-AN15"
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-COL-AN15, 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-171690532500525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN15.tgz
mv Sudoku-COL-AN15 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 '
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 ;