About the Execution of LTSMin+red for Sudoku-COL-AN09
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-171690532400477.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-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532400477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 10:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 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-AN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717259385085
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-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:29:46] [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 16:29:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:29:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 519 ms
[2024-06-01 16:29:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 12 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 16:29:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 16:29:46] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 16:29:46] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 81, 81, 81] Max Struct:[81, 81, 81, 81]
FORMULA Sudoku-COL-AN09-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-12 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 16:29:46] [INFO ] Invariant cache hit.
[2024-06-01 16:29:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 16:29:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 16:29:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 16:29:47] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[81]
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-06-01 16:29:47] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 35 ms.
[2024-06-01 16:29:47] [INFO ] Unfolded 1 HLPN properties in 0 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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
// Phase 1: matrix 729 rows 972 cols
[2024-06-01 16:29:47] [INFO ] Computed 243 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (141 resets) in 630 ms. (15 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 174 ms. (57 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2024-06-01 16:29:48] [INFO ] Invariant cache hit.
[2024-06-01 16:29:48] [INFO ] [Real]Absence check using 243 positive place invariants in 165 ms returned sat
[2024-06-01 16:29:48] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-06-01 16:29:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 16:29:49] [INFO ] Added : 0 causal constraints over 0 iterations in 129 ms. Result :sat
Minimization took 639 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 83 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 16:29:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[81]
RANDOM walk for 546133 steps (7748 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 368867 steps (23 resets) in 5008 ms. (73 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[81]
[2024-06-01 16:30:25] [INFO ] Invariant cache hit.
[2024-06-01 16:30:25] [INFO ] [Real]Absence check using 243 positive place invariants in 120 ms returned sat
[2024-06-01 16:30:25] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-06-01 16:30:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 16:30:25] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Minimization took 5219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[75] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[75] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 32 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 35 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:30:31] [INFO ] Invariant cache hit.
[2024-06-01 16:30:31] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-06-01 16:30:31] [INFO ] Invariant cache hit.
[2024-06-01 16:30:32] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2024-06-01 16:30:32] [INFO ] Redundant transitions in 35 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 1731 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 16:30:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[75] Max Struct:[81]
RANDOM walk for 558288 steps (7923 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 321914 steps (20 resets) in 5006 ms. (64 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[81]
[2024-06-01 16:31:07] [INFO ] Invariant cache hit.
[2024-06-01 16:31:08] [INFO ] [Real]Absence check using 243 positive place invariants in 197 ms returned sat
[2024-06-01 16:31:09] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-06-01 16:31:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 16:31:09] [INFO ] Added : 0 causal constraints over 0 iterations in 110 ms. Result :sat
Minimization took 5461 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:31:14] [INFO ] Invariant cache hit.
[2024-06-01 16:31:15] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 16:31:15] [INFO ] Invariant cache hit.
[2024-06-01 16:31:16] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
[2024-06-01 16:31:16] [INFO ] Redundant transitions in 8 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 1701 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 16:31:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[77] Max Struct:[81]
RANDOM walk for 556489 steps (7895 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 325794 steps (20 resets) in 5003 ms. (65 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[77] Max Struct:[81]
[2024-06-01 16:31:51] [INFO ] Invariant cache hit.
[2024-06-01 16:31:51] [INFO ] [Real]Absence check using 243 positive place invariants in 193 ms returned sat
[2024-06-01 16:31:52] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2024-06-01 16:31:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 16:31:52] [INFO ] Added : 0 causal constraints over 0 iterations in 110 ms. Result :sat
Minimization took 5222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[77] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[77] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:31:58] [INFO ] Invariant cache hit.
[2024-06-01 16:31:58] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-01 16:31:58] [INFO ] Invariant cache hit.
[2024-06-01 16:31:59] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2024-06-01 16:31:59] [INFO ] Redundant transitions in 5 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 1580 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (565 resets) in 3967 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1375 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1297 ms. (30 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141335 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141335 steps, saw 54728 distinct states, run finished after 3011 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 16:32:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4368 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 6386ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 4331 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 937 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 839 ms. (47 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 146013 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 146013 steps, saw 55669 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 16:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1701 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 1215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 243/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1701 variables, 972/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1701 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1701 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35805 ms.
Refiners :[Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 37477ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:32:53] [INFO ] Invariant cache hit.
[2024-06-01 16:32:53] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-06-01 16:32:53] [INFO ] Invariant cache hit.
[2024-06-01 16:32:55] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-06-01 16:32:55] [INFO ] Redundant transitions in 6 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 1802 ms. Remains : 972/972 places, 729/729 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[77] Max Struct:[81]
Starting property specific reduction for Sudoku-COL-AN09-UpperBounds-00
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:[81]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[81]
[2024-06-01 16:32:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (142 resets) in 532 ms. (18 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 143 ms. (69 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2024-06-01 16:32:55] [INFO ] Invariant cache hit.
[2024-06-01 16:32:56] [INFO ] [Real]Absence check using 243 positive place invariants in 142 ms returned sat
[2024-06-01 16:32:56] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2024-06-01 16:32:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 16:32:56] [INFO ] Added : 0 causal constraints over 0 iterations in 107 ms. Result :sat
Minimization took 593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 16:32:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[81]
RANDOM walk for 564800 steps (8017 resets) in 30001 ms. (18 steps per ms)
BEST_FIRST walk for 374350 steps (23 resets) in 5005 ms. (74 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[81]
[2024-06-01 16:33:32] [INFO ] Invariant cache hit.
[2024-06-01 16:33:33] [INFO ] [Real]Absence check using 243 positive place invariants in 275 ms returned sat
[2024-06-01 16:33:33] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-06-01 16:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:33:33] [INFO ] [Nat]Absence check using 243 positive place invariants in 160 ms returned sat
[2024-06-01 16:33:34] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-06-01 16:33:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 33 ms.
[2024-06-01 16:33:34] [INFO ] Added : 0 causal constraints over 0 iterations in 115 ms. Result :sat
Minimization took 2013 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[81] Max Struct:[81]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:33:36] [INFO ] Invariant cache hit.
[2024-06-01 16:33:37] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 16:33:37] [INFO ] Invariant cache hit.
[2024-06-01 16:33:38] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-06-01 16:33:38] [INFO ] Redundant transitions in 6 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 1643 ms. Remains : 972/972 places, 729/729 transitions.
[2024-06-01 16:33:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[81] Max Struct:[81]
FORMULA Sudoku-COL-AN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-13 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-14 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 740337 steps (10511 resets) in 30001 ms. (24 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Sudoku-COL-AN09-UpperBounds-00 in 73422 ms.
[2024-06-01 16:34:08] [INFO ] Flatten gal took : 129 ms
Total runtime 262610 ms.
ITS solved all properties within timeout
BK_STOP 1717259648903
--------------------
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
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-AN09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN09.tgz
mv Sudoku-COL-AN09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;