About the Execution of LTSMin+red for Sudoku-COL-BN09
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-171690532600557.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-BN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532600557
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.0K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:50 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 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:11 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 146K 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-BN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-BN09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717266513990
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-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:28:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:28:35] [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:28:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:28:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2024-06-01 18:28:35] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2024-06-01 18:28:36] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-06-01 18:28:36] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 5 cols
[2024-06-01 18:28:36] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[81, 81, 81, 81, 0] Max Struct:[81, 81, 81, 81, 81]
FORMULA Sudoku-COL-BN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 18:28:36] [INFO ] Invariant cache hit.
[2024-06-01 18:28:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 18:28:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 18:28:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 18:28:36] [INFO ] Added : 0 causal constraints over 0 iterations in 6 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 18:28:36] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 53 ms.
[2024-06-01 18:28:36] [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 1053 cols
[2024-06-01 18:28:36] [INFO ] Computed 324 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (151 resets) in 728 ms. (13 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 181 ms. (54 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[72] Max Struct:[81]
[2024-06-01 18:28:37] [INFO ] Invariant cache hit.
[2024-06-01 18:28:37] [INFO ] [Real]Absence check using 324 positive place invariants in 210 ms returned sat
[2024-06-01 18:28:38] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-06-01 18:28:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:28:38] [INFO ] [Nat]Absence check using 324 positive place invariants in 392 ms returned sat
[2024-06-01 18:28:39] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-06-01 18:28:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 18:28:39] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 694 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[72] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[72] Max Struct:[81]
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 96 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 18:28:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[72] Max Struct:[81]
RANDOM walk for 440331 steps (6642 resets) in 30001 ms. (14 steps per ms)
BEST_FIRST walk for 299231 steps (21 resets) in 5001 ms. (59 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2024-06-01 18:29:15] [INFO ] Invariant cache hit.
[2024-06-01 18:29:15] [INFO ] [Real]Absence check using 324 positive place invariants in 245 ms returned sat
[2024-06-01 18:29:16] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2024-06-01 18:29:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 18:29:16] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Minimization took 5207 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 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 28 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 39 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:29:21] [INFO ] Invariant cache hit.
[2024-06-01 18:29:22] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-06-01 18:29:22] [INFO ] Invariant cache hit.
[2024-06-01 18:29:23] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-06-01 18:29:23] [INFO ] Redundant transitions in 40 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 5ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1793 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 18:29:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[81]
RANDOM walk for 439949 steps (6638 resets) in 30001 ms. (14 steps per ms)
BEST_FIRST walk for 269320 steps (19 resets) in 5006 ms. (53 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[81]
[2024-06-01 18:29:58] [INFO ] Invariant cache hit.
[2024-06-01 18:29:59] [INFO ] [Real]Absence check using 324 positive place invariants in 237 ms returned sat
[2024-06-01 18:29:59] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2024-06-01 18:29:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 18:29:59] [INFO ] Added : 0 causal constraints over 0 iterations in 124 ms. Result :sat
Minimization took 5230 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 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 34 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 38 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:30:05] [INFO ] Invariant cache hit.
[2024-06-01 18:30:05] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 18:30:05] [INFO ] Invariant cache hit.
[2024-06-01 18:30:06] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2024-06-01 18:30:06] [INFO ] Redundant transitions in 9 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 1733 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 4983 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1036 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1173 ms. (34 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 326980 steps, run timeout after 6001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 326980 steps, saw 81629 distinct states, run finished after 6007 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 18:30: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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4049 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 9559ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (600 resets) in 5188 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 739 ms. (54 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 130411 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 130411 steps, saw 50212 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 18:30:29] [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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5484 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1782 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37076 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 42814ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:31:12] [INFO ] Invariant cache hit.
[2024-06-01 18:31:13] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 18:31:13] [INFO ] Invariant cache hit.
[2024-06-01 18:31:14] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2024-06-01 18:31:14] [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 1657 ms. Remains : 1053/1053 places, 729/729 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[74] Max Struct:[81]
Starting property specific reduction for Sudoku-COL-BN09-UpperBounds-12
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 18:31:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[81]
RANDOM walk for 10000 steps (150 resets) in 715 ms. (13 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:[70] Max Struct:[81]
[2024-06-01 18:31:15] [INFO ] Invariant cache hit.
[2024-06-01 18:31:15] [INFO ] [Real]Absence check using 324 positive place invariants in 124 ms returned sat
[2024-06-01 18:31:15] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-06-01 18:31:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 35 ms.
[2024-06-01 18:31:16] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Minimization took 728 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[70] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[70] Max Struct:[81]
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 18:31:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[70] Max Struct:[81]
RANDOM walk for 425823 steps (6427 resets) in 30001 ms. (14 steps per ms)
BEST_FIRST walk for 299732 steps (21 resets) in 5007 ms. (59 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[73] Max Struct:[81]
[2024-06-01 18:31:51] [INFO ] Invariant cache hit.
[2024-06-01 18:31:52] [INFO ] [Real]Absence check using 324 positive place invariants in 152 ms returned sat
[2024-06-01 18:31:52] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2024-06-01 18:31:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 18:31:52] [INFO ] Added : 0 causal constraints over 0 iterations in 100 ms. Result :sat
Minimization took 5262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[73] Max Struct:[81]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[73] Max Struct:[81]
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 34 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:31:58] [INFO ] Invariant cache hit.
[2024-06-01 18:31:58] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 18:31:58] [INFO ] Invariant cache hit.
[2024-06-01 18:31:59] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2024-06-01 18:31:59] [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 1609 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 18:31:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[73] Max Struct:[81]
RANDOM walk for 435478 steps (6572 resets) in 30001 ms. (14 steps per ms)
BEST_FIRST walk for 302829 steps (21 resets) in 5005 ms. (60 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[81]
[2024-06-01 18:32:34] [INFO ] Invariant cache hit.
[2024-06-01 18:32:35] [INFO ] [Real]Absence check using 324 positive place invariants in 350 ms returned sat
[2024-06-01 18:32:35] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-06-01 18:32:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 18:32:36] [INFO ] Added : 0 causal constraints over 0 iterations in 102 ms. Result :sat
Minimization took 5273 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 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:32:41] [INFO ] Invariant cache hit.
[2024-06-01 18:32:41] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 18:32:41] [INFO ] Invariant cache hit.
[2024-06-01 18:32:43] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-06-01 18:32:43] [INFO ] Redundant transitions in 4 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 1691 ms. Remains : 1053/1053 places, 729/729 transitions.
[2024-06-01 18:32:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[75] Max Struct:[81]
RANDOM walk for 428383 steps (6463 resets) in 30001 ms. (14 steps per ms)
BEST_FIRST walk for 293420 steps (20 resets) in 5003 ms. (58 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[75] Max Struct:[81]
[2024-06-01 18:33:18] [INFO ] Invariant cache hit.
[2024-06-01 18:33:18] [INFO ] [Real]Absence check using 324 positive place invariants in 384 ms returned sat
[2024-06-01 18:33:19] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2024-06-01 18:33:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 18:33:19] [INFO ] Added : 0 causal constraints over 0 iterations in 100 ms. Result :sat
Minimization took 5280 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 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:33:24] [INFO ] Invariant cache hit.
[2024-06-01 18:33:25] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-06-01 18:33:25] [INFO ] Invariant cache hit.
[2024-06-01 18:33:26] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2024-06-01 18:33:26] [INFO ] Redundant transitions in 5 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 1768 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (602 resets) in 6553 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1381 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 915 ms. (43 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 344029 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 344029 steps, saw 84209 distinct states, run finished after 6001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 18:33:34] [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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3733 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8961ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (601 resets) in 4980 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 887 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141774 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141774 steps, saw 52332 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 18:33:48] [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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5690 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 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) 324/1053 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19536 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 25495ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1053/1053 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 18:34:14] [INFO ] Invariant cache hit.
[2024-06-01 18:34:14] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 18:34:14] [INFO ] Invariant cache hit.
[2024-06-01 18:34:15] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-06-01 18:34:15] [INFO ] Redundant transitions in 5 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 1634 ms. Remains : 1053/1053 places, 729/729 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[75] Max Struct:[81]
Ending property specific reduction for Sudoku-COL-BN09-UpperBounds-12 in 181463 ms.
[2024-06-01 18:34:15] [INFO ] Flatten gal took : 125 ms
[2024-06-01 18:34:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 18:34:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 8 ms.
Total runtime 340800 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-BN09-UpperBounds-12
BK_STOP 1717266856225
--------------------
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-BN09-UpperBounds-12
ub formula formula --maxsum=/tmp/662/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-BN09"
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-BN09, 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-171690532600557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN09.tgz
mv Sudoku-COL-BN09 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 ;