About the Execution of LTSMin+red for Sudoku-COL-AN16
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-171690532600533.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-AN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532600533
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Apr 12 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 10:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-AN16-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717265263183
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-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:07:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:07:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:07:44] [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 18:07:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:07:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 501 ms
[2024-06-01 18:07:44] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-06-01 18:07:45] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 18:07:45] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 18:07:45] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[256, 0, 256, 256] Max Struct:[256, 256, 256, 256]
FORMULA Sudoku-COL-AN16-UpperBounds-14 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-13 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-08 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-09 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-10 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-12 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 18:07:45] [INFO ] Invariant cache hit.
[2024-06-01 18:07:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 18:07:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 18:07:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 18:07:45] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[256]
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-06-01 18:07:45] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 79 ms.
[2024-06-01 18:07:45] [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:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
// Phase 1: matrix 4096 rows 4864 cols
[2024-06-01 18:07:45] [INFO ] Computed 768 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (44 resets) in 3425 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 859 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[230] Max Struct:[256]
[2024-06-01 18:07:49] [INFO ] Invariant cache hit.
[2024-06-01 18:07:51] [INFO ] [Real]Absence check using 768 positive place invariants in 1459 ms returned sat
[2024-06-01 18:07:54] [INFO ] [Real]Absence check using state equation in 2987 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[230] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[230] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 246 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 18:07:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[230] Max Struct:[256]
RANDOM walk for 88714 steps (392 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 57755 steps (0 resets) in 5073 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234] Max Struct:[256]
[2024-06-01 18:08:30] [INFO ] Invariant cache hit.
[2024-06-01 18:08:33] [INFO ] [Real]Absence check using 768 positive place invariants in 2535 ms returned sat
[2024-06-01 18:08:56] [INFO ] [Real]Absence check using state equation in 23506 ms returned sat
[2024-06-01 18:08:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 264 ms.
[2024-06-01 18:08:58] [INFO ] Added : 0 causal constraints over 0 iterations in 736 ms. Result :sat
Minimization took 5358 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 251 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 162 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:09:04] [INFO ] Invariant cache hit.
[2024-06-01 18:09:08] [INFO ] Implicit Places using invariants in 3828 ms returned []
[2024-06-01 18:09:08] [INFO ] Invariant cache hit.
[2024-06-01 18:09:22] [INFO ] Implicit Places using invariants and state equation in 14019 ms returned []
Implicit Place search using SMT with State Equation took 17851 ms to find 0 implicit places.
[2024-06-01 18:09:22] [INFO ] Redundant transitions in 219 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 18247 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 18:09:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[234] Max Struct:[256]
RANDOM walk for 88078 steps (389 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 61157 steps (0 resets) in 5004 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[256]
[2024-06-01 18:09:57] [INFO ] Invariant cache hit.
[2024-06-01 18:09:59] [INFO ] [Real]Absence check using 768 positive place invariants in 1251 ms returned sat
[2024-06-01 18:10:24] [INFO ] [Real]Absence check using state equation in 25512 ms returned sat
[2024-06-01 18:10:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 184 ms.
[2024-06-01 18:10:25] [INFO ] Added : 0 causal constraints over 0 iterations in 517 ms. Result :sat
Minimization took 5364 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 271 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 108 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:10:31] [INFO ] Invariant cache hit.
[2024-06-01 18:10:34] [INFO ] Implicit Places using invariants in 3179 ms returned []
[2024-06-01 18:10:34] [INFO ] Invariant cache hit.
[2024-06-01 18:10:48] [INFO ] Implicit Places using invariants and state equation in 13501 ms returned []
Implicit Place search using SMT with State Equation took 16687 ms to find 0 implicit places.
[2024-06-01 18:10:48] [INFO ] Redundant transitions in 238 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 17051 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 18:10:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[235] Max Struct:[256]
RANDOM walk for 87972 steps (389 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 61263 steps (0 resets) in 5083 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[235] Max Struct:[256]
[2024-06-01 18:11:23] [INFO ] Invariant cache hit.
[2024-06-01 18:11:25] [INFO ] [Real]Absence check using 768 positive place invariants in 1202 ms returned sat
[2024-06-01 18:11:51] [INFO ] [Real]Absence check using state equation in 26174 ms returned sat
[2024-06-01 18:11:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 172 ms.
[2024-06-01 18:11:52] [INFO ] Added : 0 causal constraints over 0 iterations in 490 ms. Result :sat
Minimization took 5434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[235] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[235] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 115 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 75 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:11:57] [INFO ] Invariant cache hit.
[2024-06-01 18:12:01] [INFO ] Implicit Places using invariants in 3654 ms returned []
[2024-06-01 18:12:01] [INFO ] Invariant cache hit.
[2024-06-01 18:12:15] [INFO ] Implicit Places using invariants and state equation in 14136 ms returned []
Implicit Place search using SMT with State Equation took 17814 ms to find 0 implicit places.
[2024-06-01 18:12:15] [INFO ] Redundant transitions in 141 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 18040 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 22744 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5350 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5406 ms. (7 steps per ms) remains 2/2 properties
Probabilistic random walk after 227149 steps, saw 227080 distinct states, run finished after 27097 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 18:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 768/4864 variables, 768/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4864 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8960/8960 variables, and 5632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 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/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2946 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9574ms 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 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 75 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 23914 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4144 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4792 ms. (8 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 224150 steps, run timeout after 27001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 224150 steps, saw 224080 distinct states, run finished after 27008 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 18:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 768/4864 variables, 768/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4864 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4096/8960 variables, 4864/5632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8960 variables, 0/5632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8960 variables, 0/5632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8960/8960 variables, and 5632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45060 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 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/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 768/4864 variables, 768/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4864 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4096/8960 variables, 4864/5632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8960/8960 variables, and 5632 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45049 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 4864/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90794ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 106 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 72 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:15:09] [INFO ] Invariant cache hit.
[2024-06-01 18:15:13] [INFO ] Implicit Places using invariants in 3465 ms returned []
[2024-06-01 18:15:13] [INFO ] Invariant cache hit.
[2024-06-01 18:15:27] [INFO ] Implicit Places using invariants and state equation in 14731 ms returned []
Implicit Place search using SMT with State Equation took 18198 ms to find 0 implicit places.
[2024-06-01 18:15:27] [INFO ] Redundant transitions in 148 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 18431 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[235] Max Struct:[256]
Starting property specific reduction for Sudoku-COL-AN16-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:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
[2024-06-01 18:15:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (44 resets) in 3605 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 976 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[233] Max Struct:[256]
[2024-06-01 18:15:32] [INFO ] Invariant cache hit.
[2024-06-01 18:15:34] [INFO ] [Real]Absence check using 768 positive place invariants in 1451 ms returned sat
[2024-06-01 18:15:37] [INFO ] [Real]Absence check using state equation in 3095 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[233] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[233] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 69 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 4864/4864 places, 4096/4096 transitions.
[2024-06-01 18:15:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[233] Max Struct:[256]
RANDOM walk for 83069 steps (367 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 51758 steps (0 resets) in 5018 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[233] Max Struct:[256]
[2024-06-01 18:16:12] [INFO ] Invariant cache hit.
[2024-06-01 18:16:14] [INFO ] [Real]Absence check using 768 positive place invariants in 1456 ms returned sat
[2024-06-01 18:16:34] [INFO ] [Real]Absence check using state equation in 19779 ms returned sat
[2024-06-01 18:16:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 165 ms.
[2024-06-01 18:16:35] [INFO ] Added : 0 causal constraints over 0 iterations in 509 ms. Result :sat
Minimization took 4692 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[233] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[233] Max Struct:[256]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 65 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:16:40] [INFO ] Invariant cache hit.
[2024-06-01 18:16:43] [INFO ] Implicit Places using invariants in 3309 ms returned []
[2024-06-01 18:16:43] [INFO ] Invariant cache hit.
[2024-06-01 18:16:57] [INFO ] Implicit Places using invariants and state equation in 14318 ms returned []
Implicit Place search using SMT with State Equation took 17652 ms to find 0 implicit places.
[2024-06-01 18:16:58] [INFO ] Redundant transitions in 148 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 17887 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 24285 ms. (1 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4644 ms. (8 steps per ms) remains 1/1 properties
[2024-06-01 18:17:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3696ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 76 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 19083 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4418 ms. (9 steps per ms) remains 1/1 properties
Probabilistic random walk after 233502 steps, saw 233431 distinct states, run finished after 21039 ms. (steps per millisecond=11 ) properties seen :0
[2024-06-01 18:17:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9750 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 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/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9653 ms.
Refiners :[Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19746ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 71 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 18:17:57] [INFO ] Invariant cache hit.
[2024-06-01 18:18:00] [INFO ] Implicit Places using invariants in 3181 ms returned []
[2024-06-01 18:18:00] [INFO ] Invariant cache hit.
[2024-06-01 18:18:15] [INFO ] Implicit Places using invariants and state equation in 14139 ms returned []
Implicit Place search using SMT with State Equation took 17366 ms to find 0 implicit places.
[2024-06-01 18:18:15] [INFO ] Redundant transitions in 148 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 17602 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[233] Max Struct:[256]
Ending property specific reduction for Sudoku-COL-AN16-UpperBounds-01 in 167348 ms.
[2024-06-01 18:18:16] [INFO ] Flatten gal took : 794 ms
[2024-06-01 18:18:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 21 ms.
[2024-06-01 18:18:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 45 ms.
Total runtime 632134 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-AN16-UpperBounds-01
BK_STOP 1717265896788
--------------------
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-AN16-UpperBounds-01
ub formula formula --maxsum=/tmp/699/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-AN16"
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-AN16, 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-171690532600533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN16.tgz
mv Sudoku-COL-AN16 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 ;