fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530600565
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Sudoku-COL-BN16

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13230.052 3600000.00 8633032.00 5997.70 256 256 256 256 256 256 256 256 256 256 256 256 256 256 256 ? normal

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.r399-tall-171690530600565.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 greatspnxred
Input is Sudoku-COL-BN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530600565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.6K Apr 12 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 13:57 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 446K 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-BN16-UpperBounds-00
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-01
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-02
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-03
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-04
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-05
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-06
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-07
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-08
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-09
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-10
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-11
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-12
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-13
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-14
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717056135171

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 08:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 08:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:02:16] [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-05-30 08:02:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 08:02:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 655 ms
[2024-05-30 08:02:17] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 25 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-05-30 08:02:17] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2024-05-30 08:02:17] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 08:02:17] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[256, 256, 256, 256, 0] Max Struct:[256, 256, 256, 256, 256]
FORMULA Sudoku-COL-BN16-UpperBounds-13 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-10 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-03 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-08 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-12 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-14 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-01 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-09 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-11 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 08:02:17] [INFO ] Invariant cache hit.
[2024-05-30 08:02:17] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-30 08:02:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-30 08:02:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 08:02:17] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[256]
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-05-30 08:02:17] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 243 ms.
[2024-05-30 08:02:17] [INFO ] Unfolded 1 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
// Phase 1: matrix 4096 rows 5120 cols
[2024-05-30 08:02:17] [INFO ] Computed 1024 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (47 resets) in 4397 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 939 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[215] Max Struct:[256]
[2024-05-30 08:02:23] [INFO ] Invariant cache hit.
[2024-05-30 08:02:24] [INFO ] [Real]Absence check using 1024 positive place invariants in 1071 ms returned sat
[2024-05-30 08:02:28] [INFO ] [Real]Absence check using state equation in 3361 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[215] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[215] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 312 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:02:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[215] Max Struct:[256]
RANDOM walk for 69824 steps (331 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 54571 steps (0 resets) in 5041 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[219] Max Struct:[256]
[2024-05-30 08:03:03] [INFO ] Invariant cache hit.
[2024-05-30 08:03:06] [INFO ] [Real]Absence check using 1024 positive place invariants in 1956 ms returned sat
[2024-05-30 08:03:20] [INFO ] [Real]Absence check using state equation in 14094 ms returned sat
[2024-05-30 08:03:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 186 ms.
[2024-05-30 08:03:21] [INFO ] Added : 0 causal constraints over 0 iterations in 583 ms. Result :sat
Minimization took 4783 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[219] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[219] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 157 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 268 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:03:26] [INFO ] Invariant cache hit.
[2024-05-30 08:03:33] [INFO ] Implicit Places using invariants in 7327 ms returned []
[2024-05-30 08:03:33] [INFO ] Invariant cache hit.
[2024-05-30 08:04:12] [INFO ] Implicit Places using invariants and state equation in 38775 ms returned []
Implicit Place search using SMT with State Equation took 46110 ms to find 0 implicit places.
[2024-05-30 08:04:12] [INFO ] Redundant transitions in 253 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 46652 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:04:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[219] Max Struct:[256]
RANDOM walk for 68158 steps (323 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 52519 steps (0 resets) in 5010 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[222] Max Struct:[256]
[2024-05-30 08:04:47] [INFO ] Invariant cache hit.
[2024-05-30 08:04:50] [INFO ] [Real]Absence check using 1024 positive place invariants in 2542 ms returned sat
[2024-05-30 08:05:11] [INFO ] [Real]Absence check using state equation in 20945 ms returned sat
[2024-05-30 08:05:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 08:05:15] [INFO ] [Nat]Absence check using 1024 positive place invariants in 2654 ms returned sat
[2024-05-30 08:05:44] [INFO ] [Nat]Absence check using state equation in 29132 ms returned sat
[2024-05-30 08:05:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 168 ms.
[2024-05-30 08:05:45] [INFO ] Added : 0 causal constraints over 0 iterations in 505 ms. Result :sat
Minimization took 4774 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[222] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[222] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 209 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 125 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:05:50] [INFO ] Invariant cache hit.
[2024-05-30 08:05:57] [INFO ] Implicit Places using invariants in 7405 ms returned []
[2024-05-30 08:05:57] [INFO ] Invariant cache hit.
[2024-05-30 08:06:36] [INFO ] Implicit Places using invariants and state equation in 38978 ms returned []
Implicit Place search using SMT with State Equation took 46387 ms to find 0 implicit places.
[2024-05-30 08:06:36] [INFO ] Redundant transitions in 280 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 46804 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:06:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[222] Max Struct:[256]
RANDOM walk for 68436 steps (324 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 53493 steps (0 resets) in 5032 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[222] Max Struct:[256]
[2024-05-30 08:07:11] [INFO ] Invariant cache hit.
[2024-05-30 08:07:15] [INFO ] [Real]Absence check using 1024 positive place invariants in 2663 ms returned sat
[2024-05-30 08:07:35] [INFO ] [Real]Absence check using state equation in 20317 ms returned sat
[2024-05-30 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 08:07:38] [INFO ] [Nat]Absence check using 1024 positive place invariants in 2687 ms returned sat
[2024-05-30 08:08:07] [INFO ] [Nat]Absence check using state equation in 29138 ms returned sat
[2024-05-30 08:08:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 185 ms.
[2024-05-30 08:08:08] [INFO ] Added : 0 causal constraints over 0 iterations in 506 ms. Result :sat
Minimization took 4775 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[222] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[222] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 113 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 104 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:08:13] [INFO ] Invariant cache hit.
[2024-05-30 08:08:20] [INFO ] Implicit Places using invariants in 7363 ms returned []
[2024-05-30 08:08:20] [INFO ] Invariant cache hit.
[2024-05-30 08:09:00] [INFO ] Implicit Places using invariants and state equation in 39940 ms returned []
Implicit Place search using SMT with State Equation took 47309 ms to find 0 implicit places.
[2024-05-30 08:09:01] [INFO ] Redundant transitions in 177 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 47602 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 27202 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5527 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4857 ms. (8 steps per ms) remains 2/2 properties
Probabilistic random walk after 247424 steps, saw 247350 distinct states, run finished after 30053 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 08:09:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2768 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6331ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 116 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 24429 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4877 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3919 ms. (10 steps per ms) remains 2/2 properties
Probabilistic random walk after 191365 steps, saw 191311 distinct states, run finished after 24111 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-30 08:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45054 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45056 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91000ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 115 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 201 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:11:52] [INFO ] Invariant cache hit.
[2024-05-30 08:12:00] [INFO ] Implicit Places using invariants in 7518 ms returned []
[2024-05-30 08:12:00] [INFO ] Invariant cache hit.
[2024-05-30 08:12:40] [INFO ] Implicit Places using invariants and state equation in 40559 ms returned []
Implicit Place search using SMT with State Equation took 48082 ms to find 0 implicit places.
[2024-05-30 08:12:40] [INFO ] Redundant transitions in 174 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 48464 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[222] Max Struct:[256]
Starting property specific reduction for Sudoku-COL-BN16-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
[2024-05-30 08:12:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (47 resets) in 4502 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1031 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[215] Max Struct:[256]
[2024-05-30 08:12:46] [INFO ] Invariant cache hit.
[2024-05-30 08:12:47] [INFO ] [Real]Absence check using 1024 positive place invariants in 1144 ms returned sat
[2024-05-30 08:12:51] [INFO ] [Real]Absence check using state equation in 3377 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[215] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[215] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 114 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:12:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[215] Max Struct:[256]
RANDOM walk for 67250 steps (318 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 49043 steps (0 resets) in 5018 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[219] Max Struct:[256]
[2024-05-30 08:13:26] [INFO ] Invariant cache hit.
[2024-05-30 08:13:29] [INFO ] [Real]Absence check using 1024 positive place invariants in 2141 ms returned sat
[2024-05-30 08:13:44] [INFO ] [Real]Absence check using state equation in 14855 ms returned sat
[2024-05-30 08:13:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 153 ms.
[2024-05-30 08:13:44] [INFO ] Added : 0 causal constraints over 0 iterations in 504 ms. Result :sat
Minimization took 4779 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[219] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[219] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 114 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 115 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:13:50] [INFO ] Invariant cache hit.
[2024-05-30 08:13:57] [INFO ] Implicit Places using invariants in 7584 ms returned []
[2024-05-30 08:13:57] [INFO ] Invariant cache hit.
[2024-05-30 08:14:38] [INFO ] Implicit Places using invariants and state equation in 41015 ms returned []
Implicit Place search using SMT with State Equation took 48602 ms to find 0 implicit places.
[2024-05-30 08:14:38] [INFO ] Redundant transitions in 174 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 48907 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:14:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[219] Max Struct:[256]
RANDOM walk for 67328 steps (319 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 48650 steps (0 resets) in 5036 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[222] Max Struct:[256]
[2024-05-30 08:15:13] [INFO ] Invariant cache hit.
[2024-05-30 08:15:17] [INFO ] [Real]Absence check using 1024 positive place invariants in 2748 ms returned sat
[2024-05-30 08:15:38] [INFO ] [Real]Absence check using state equation in 21542 ms returned sat
[2024-05-30 08:15:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 08:15:42] [INFO ] [Nat]Absence check using 1024 positive place invariants in 2780 ms returned sat
[2024-05-30 08:16:12] [INFO ] [Nat]Absence check using state equation in 30173 ms returned sat
[2024-05-30 08:16:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 187 ms.
[2024-05-30 08:16:12] [INFO ] Added : 0 causal constraints over 0 iterations in 523 ms. Result :sat
Minimization took 4773 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[222] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[222] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 102 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 125 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:16:17] [INFO ] Invariant cache hit.
[2024-05-30 08:16:25] [INFO ] Implicit Places using invariants in 7655 ms returned []
[2024-05-30 08:16:25] [INFO ] Invariant cache hit.
[2024-05-30 08:17:06] [INFO ] Implicit Places using invariants and state equation in 41051 ms returned []
Implicit Place search using SMT with State Equation took 48716 ms to find 0 implicit places.
[2024-05-30 08:17:06] [INFO ] Redundant transitions in 174 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 49022 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 08:17:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[222] Max Struct:[256]
RANDOM walk for 67158 steps (318 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 56844 steps (0 resets) in 5085 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[222] Max Struct:[256]
[2024-05-30 08:17:41] [INFO ] Invariant cache hit.
[2024-05-30 08:17:45] [INFO ] [Real]Absence check using 1024 positive place invariants in 2738 ms returned sat
[2024-05-30 08:18:06] [INFO ] [Real]Absence check using state equation in 21356 ms returned sat
[2024-05-30 08:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 08:18:09] [INFO ] [Nat]Absence check using 1024 positive place invariants in 2654 ms returned sat
[2024-05-30 08:18:38] [INFO ] [Nat]Absence check using state equation in 28834 ms returned sat
[2024-05-30 08:18:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 149 ms.
[2024-05-30 08:18:39] [INFO ] Added : 0 causal constraints over 0 iterations in 491 ms. Result :sat
Minimization took 4769 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[222] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[222] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 105 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 98 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:18:44] [INFO ] Invariant cache hit.
[2024-05-30 08:18:51] [INFO ] Implicit Places using invariants in 7403 ms returned []
[2024-05-30 08:18:51] [INFO ] Invariant cache hit.
[2024-05-30 08:19:31] [INFO ] Implicit Places using invariants and state equation in 39292 ms returned []
Implicit Place search using SMT with State Equation took 46702 ms to find 0 implicit places.
[2024-05-30 08:19:31] [INFO ] Redundant transitions in 170 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 46976 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 22771 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4239 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4026 ms. (9 steps per ms) remains 2/2 properties
Probabilistic random walk after 216944 steps, saw 216881 distinct states, run finished after 24081 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-30 08:20:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2581 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6148ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 106 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 22880 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4094 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4026 ms. (9 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204035 steps, run timeout after 24007 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 204035 steps, saw 203974 distinct states, run finished after 24011 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 08:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45075 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91185ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 140 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 99 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 08:22:13] [INFO ] Invariant cache hit.
[2024-05-30 08:22:20] [INFO ] Implicit Places using invariants in 7219 ms returned []
[2024-05-30 08:22:20] [INFO ] Invariant cache hit.
[2024-05-30 08:23:00] [INFO ] Implicit Places using invariants and state equation in 39679 ms returned []
Implicit Place search using SMT with State Equation took 46899 ms to find 0 implicit places.
[2024-05-30 08:23:00] [INFO ] Redundant transitions in 172 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 47185 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[222] Max Struct:[256]
Ending property specific reduction for Sudoku-COL-BN16-UpperBounds-15 in 619820 ms.
[2024-05-30 08:23:01] [INFO ] Flatten gal took : 460 ms
[2024-05-30 08:23:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2024-05-30 08:23:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 37 ms.
Total runtime 1244947 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-BN16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 5120
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.109s, Sys 0.015s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.017s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 790
MODEL NAME: /home/mcc/execution/415/model
5120 places, 4096 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-BN16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-COL-BN16, 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 r399-tall-171690530600565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN16.tgz
mv Sudoku-COL-BN16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;