fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2479.884 373194.00 461712.00 625.10 169 169 169 169 169 169 169 169 169 169 169 169 169 169 169 169 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-171690530500509.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-AN13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530500509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717044135136

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-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 04:42:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 04:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 04:42: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 04:42:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 04:42:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2024-05-30 04:42:16] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-05-30 04:42:16] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-30 04:42:16] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 04:42:16] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[169, 169, 169, 0] Max Struct:[169, 169, 169, 169]
FORMULA Sudoku-COL-AN13-UpperBounds-08 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-10 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-11 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-12 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-02 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-04 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-07 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-09 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-01 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-05 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-15 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN13-UpperBounds-00 169 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 04:42:16] [INFO ] Invariant cache hit.
[2024-05-30 04:42:17] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-30 04:42:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-30 04:42:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 04:42:17] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[169]
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-05-30 04:42:17] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 68 ms.
[2024-05-30 04:42: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:[169]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[169]
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 04:42:17] [INFO ] Computed 507 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[169]
RANDOM walk for 10000 steps (67 resets) in 1815 ms. (5 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 435 ms. (22 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[158] Max Struct:[169]
[2024-05-30 04:42:19] [INFO ] Invariant cache hit.
[2024-05-30 04:42:20] [INFO ] [Real]Absence check using 507 positive place invariants in 966 ms returned sat
[2024-05-30 04:42:23] [INFO ] [Real]Absence check using state equation in 2961 ms returned sat
[2024-05-30 04:42:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 97 ms.
[2024-05-30 04:42:24] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[158] Max Struct:[169]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[158] Max Struct:[169]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 161 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-05-30 04:42:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[158] Max Struct:[169]
RANDOM walk for 173520 steps (1169 resets) in 30001 ms. (5 steps per ms)
BEST_FIRST walk for 124443 steps (1 resets) in 5026 ms. (24 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[158] Max Struct:[169]
[2024-05-30 04:42:59] [INFO ] Invariant cache hit.
[2024-05-30 04:43:01] [INFO ] [Real]Absence check using 507 positive place invariants in 881 ms returned sat
[2024-05-30 04:43:07] [INFO ] [Real]Absence check using state equation in 6891 ms returned sat
[2024-05-30 04:43:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 92 ms.
[2024-05-30 04:43:08] [INFO ] Added : 0 causal constraints over 0 iterations in 283 ms. Result :sat
Minimization took 5478 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[158] Max Struct:[169]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[158] Max Struct:[169]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 111 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 110 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 04:43:14] [INFO ] Invariant cache hit.
[2024-05-30 04:43:15] [INFO ] Implicit Places using invariants in 1351 ms returned []
[2024-05-30 04:43:15] [INFO ] Invariant cache hit.
[2024-05-30 04:43:18] [INFO ] Implicit Places using invariants and state equation in 3295 ms returned []
Implicit Place search using SMT with State Equation took 4649 ms to find 0 implicit places.
[2024-05-30 04:43:18] [INFO ] Redundant transitions in 101 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 4872 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 9362 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2595 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3133 ms. (12 steps per ms) remains 2/2 properties
Probabilistic random walk after 177913 steps, saw 177783 distinct states, run finished after 12011 ms. (steps per millisecond=14 ) properties seen :0
[2024-05-30 04:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3372 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 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/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7201ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 1277 ms.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 50 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7899 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2496 ms. (16 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 109163 steps, run timeout after 6015 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 109163 steps, saw 109079 distinct states, run finished after 6019 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-30 04:43:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45033 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9492 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 54826ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 139 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 53 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 04:44:47] [INFO ] Invariant cache hit.
[2024-05-30 04:44:48] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-05-30 04:44:48] [INFO ] Invariant cache hit.
[2024-05-30 04:44:52] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 4597 ms to find 0 implicit places.
[2024-05-30 04:44:52] [INFO ] Redundant transitions in 115 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 4776 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[158] Max Struct:[169]
Starting property specific reduction for Sudoku-COL-AN13-UpperBounds-03
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:[169]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[169]
[2024-05-30 04:44:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[169]
RANDOM walk for 10000 steps (67 resets) in 1770 ms. (5 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 429 ms. (23 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[152] Max Struct:[169]
[2024-05-30 04:44:54] [INFO ] Invariant cache hit.
[2024-05-30 04:44:55] [INFO ] [Real]Absence check using 507 positive place invariants in 559 ms returned sat
[2024-05-30 04:44:58] [INFO ] [Real]Absence check using state equation in 3644 ms returned sat
[2024-05-30 04:44:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 91 ms.
[2024-05-30 04:44:59] [INFO ] Added : 0 causal constraints over 0 iterations in 321 ms. Result :sat
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[152] Max Struct:[169]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[152] Max Struct:[169]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-05-30 04:44:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[152] Max Struct:[169]
RANDOM walk for 173039 steps (1166 resets) in 30001 ms. (5 steps per ms)
BEST_FIRST walk for 120494 steps (1 resets) in 5024 ms. (23 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[155] Max Struct:[169]
[2024-05-30 04:45:34] [INFO ] Invariant cache hit.
[2024-05-30 04:45:36] [INFO ] [Real]Absence check using 507 positive place invariants in 1781 ms returned sat
[2024-05-30 04:45:46] [INFO ] [Real]Absence check using state equation in 9885 ms returned sat
[2024-05-30 04:45:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 98 ms.
[2024-05-30 04:45:46] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 5478 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[155] Max Struct:[169]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[155] Max Struct:[169]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 04:45:52] [INFO ] Invariant cache hit.
[2024-05-30 04:45:53] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2024-05-30 04:45:53] [INFO ] Invariant cache hit.
[2024-05-30 04:45:57] [INFO ] Implicit Places using invariants and state equation in 3211 ms returned []
Implicit Place search using SMT with State Equation took 4595 ms to find 0 implicit places.
[2024-05-30 04:45:57] [INFO ] Redundant transitions in 46 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 4686 ms. Remains : 2704/2704 places, 2197/2197 transitions.
[2024-05-30 04:45:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[155] Max Struct:[169]
RANDOM walk for 172950 steps (1166 resets) in 30001 ms. (5 steps per ms)
BEST_FIRST walk for 120010 steps (1 resets) in 5025 ms. (23 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[155] Max Struct:[169]
[2024-05-30 04:46:32] [INFO ] Invariant cache hit.
[2024-05-30 04:46:34] [INFO ] [Real]Absence check using 507 positive place invariants in 1822 ms returned sat
[2024-05-30 04:46:44] [INFO ] [Real]Absence check using state equation in 10092 ms returned sat
[2024-05-30 04:46:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 85 ms.
[2024-05-30 04:46:44] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 5414 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[155] Max Struct:[169]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[155] Max Struct:[169]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 04:46:50] [INFO ] Invariant cache hit.
[2024-05-30 04:46:51] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2024-05-30 04:46:51] [INFO ] Invariant cache hit.
[2024-05-30 04:46:54] [INFO ] Implicit Places using invariants and state equation in 3155 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
[2024-05-30 04:46:55] [INFO ] Redundant transitions in 45 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 4630 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 10127 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2104 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2029 ms. (19 steps per ms) remains 2/2 properties
Probabilistic random walk after 115231 steps, saw 115144 distinct states, run finished after 9016 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-30 04:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3295 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 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/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7211ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 44 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 10618 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2070 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1952 ms. (20 steps per ms) remains 2/2 properties
Probabilistic random walk after 115231 steps, saw 115144 distinct states, run finished after 9067 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-30 04:47:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 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/2197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 507/2704 variables, 507/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/4901 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 14439 ms.
Refiners :[Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 31 ms.
FORMULA Sudoku-COL-AN13-UpperBounds-06 169 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN13-UpperBounds-13 169 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN13-UpperBounds-14 169 TECHNIQUES REACHABILITY_MAX
FORMULA Sudoku-COL-AN13-UpperBounds-03 169 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Sudoku-COL-AN13-UpperBounds-03 in 215791 ms.
[2024-05-30 04:48:28] [INFO ] Flatten gal took : 253 ms
Total runtime 371986 ms.
ITS solved all properties within timeout

BK_STOP 1717044508330

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN13"
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-AN13, 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-171690530500509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 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 ;