About the Execution of GreatSPN+red for Sudoku-PT-AN15
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-171690530900685.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-PT-AN15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530900685
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 12 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M Apr 12 10:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 811K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 840K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 12 11:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 12 11:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 211K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 509K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-PT-AN15-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717081086444
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:58:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 14:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:58:07] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-05-30 14:58:07] [INFO ] Transformed 4050 places.
[2024-05-30 14:58:07] [INFO ] Transformed 3375 transitions.
[2024-05-30 14:58:07] [INFO ] Found NUPN structural information;
[2024-05-30 14:58:07] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 38 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[225, 0, 225, 1, 1, 0, 1, 1, 1, 1, 1] Max Struct:[225, 3375, 225, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-04 225 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-02 225 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-07 225 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-UpperBounds-00 225 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[3375, 1]
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-30 14:58:08] [INFO ] Computed 675 invariants in 81 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[3375, 1]
RANDOM walk for 10000 steps (50 resets) in 2878 ms. (3 steps per ms)
FORMULA Sudoku-PT-AN15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 732 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[204] Max Struct:[3375]
[2024-05-30 14:58:11] [INFO ] Invariant cache hit.
[2024-05-30 14:58:14] [INFO ] [Real]Absence check using 675 positive place invariants in 1425 ms returned sat
[2024-05-30 14:58:16] [INFO ] [Real]Absence check using state equation in 2857 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[204] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[204] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 285 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 14:58:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[204] Max Struct:[3375]
RANDOM walk for 108001 steps (544 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 70079 steps (0 resets) in 5035 ms. (13 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[3375]
[2024-05-30 14:58:52] [INFO ] Invariant cache hit.
[2024-05-30 14:58:56] [INFO ] [Real]Absence check using 675 positive place invariants in 3255 ms returned sat
[2024-05-30 14:59:09] [INFO ] [Real]Absence check using state equation in 13142 ms returned sat
[2024-05-30 14:59:09] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 82 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 100 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 14:59:15] [INFO ] Invariant cache hit.
[2024-05-30 14:59:24] [INFO ] Implicit Places using invariants in 9324 ms returned []
[2024-05-30 14:59:24] [INFO ] Invariant cache hit.
[2024-05-30 14:59:36] [INFO ] Implicit Places using invariants and state equation in 11962 ms returned []
Implicit Place search using SMT with State Equation took 21290 ms to find 0 implicit places.
[2024-05-30 14:59:36] [INFO ] Redundant transitions in 250 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 21661 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 14:59:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[205] Max Struct:[3375]
RANDOM walk for 113883 steps (573 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 64771 steps (0 resets) in 5030 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[205] Max Struct:[3375]
[2024-05-30 15:00:11] [INFO ] Invariant cache hit.
[2024-05-30 15:00:15] [INFO ] [Real]Absence check using 675 positive place invariants in 3430 ms returned sat
[2024-05-30 15:00:29] [INFO ] [Real]Absence check using state equation in 13651 ms returned sat
[2024-05-30 15:00:29] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : Max Seen:[205] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[205] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 72 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 64 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 15:00:34] [INFO ] Invariant cache hit.
[2024-05-30 15:00:43] [INFO ] Implicit Places using invariants in 8893 ms returned []
[2024-05-30 15:00:43] [INFO ] Invariant cache hit.
[2024-05-30 15:00:56] [INFO ] Implicit Places using invariants and state equation in 12894 ms returned []
Implicit Place search using SMT with State Equation took 21792 ms to find 0 implicit places.
[2024-05-30 15:00:56] [INFO ] Redundant transitions in 195 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 22071 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14283 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3668 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3042 ms. (13 steps per ms) remains 2/2 properties
Probabilistic random walk after 163818 steps, saw 163761 distinct states, run finished after 15039 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 15:01:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 675/4050 variables, 675/4050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 675/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4050 variables, 0/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 8775 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5016 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 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/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2997 ms.
Refiners :[Domain max(s): 3375/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9077ms 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 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 58 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14066 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3304 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2772 ms. (14 steps per ms) remains 2/2 properties
Probabilistic random walk after 162818 steps, saw 162761 distinct states, run finished after 15014 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 15:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 675/4050 variables, 675/4050 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 675/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4050 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7425/7425 variables, and 8775 constraints, problems are : Problem set: 1 solved, 1 unsolved in 15791 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 675/4050 variables, 675/4050 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 675/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4050 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 8775 constraints, problems are : Problem set: 1 solved, 1 unsolved in 19168 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 35791ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 206 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 40 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[205] Max Struct:[3375]
Starting property specific reduction for Sudoku-PT-AN15-UpperBounds-01
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[3375]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3375]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3375]
[2024-05-30 15:02:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3375]
RANDOM walk for 10000 steps (50 resets) in 2715 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 860 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[203] Max Struct:[3375]
[2024-05-30 15:02:26] [INFO ] Invariant cache hit.
[2024-05-30 15:02:28] [INFO ] [Real]Absence check using 675 positive place invariants in 904 ms returned sat
[2024-05-30 15:02:31] [INFO ] [Real]Absence check using state equation in 3452 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[203] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[203] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 57 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 15:02:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[203] Max Struct:[3375]
RANDOM walk for 107785 steps (543 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 59139 steps (0 resets) in 5030 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[3375]
[2024-05-30 15:03:06] [INFO ] Invariant cache hit.
[2024-05-30 15:03:11] [INFO ] [Real]Absence check using 675 positive place invariants in 4255 ms returned sat
[2024-05-30 15:03:34] [INFO ] [Real]Absence check using state equation in 23000 ms returned sat
[2024-05-30 15:03:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 148 ms.
[2024-05-30 15:03:35] [INFO ] Added : 0 causal constraints over 0 iterations in 447 ms. Result :sat
Minimization took 4681 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 59 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 55 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 15:03:40] [INFO ] Invariant cache hit.
[2024-05-30 15:03:50] [INFO ] Implicit Places using invariants in 10029 ms returned []
[2024-05-30 15:03:50] [INFO ] Invariant cache hit.
[2024-05-30 15:04:03] [INFO ] Implicit Places using invariants and state equation in 13109 ms returned []
Implicit Place search using SMT with State Equation took 23142 ms to find 0 implicit places.
[2024-05-30 15:04:03] [INFO ] Redundant transitions in 113 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 23317 ms. Remains : 4050/4050 places, 3375/3375 transitions.
[2024-05-30 15:04:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[207] Max Struct:[3375]
RANDOM walk for 105238 steps (530 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 70848 steps (0 resets) in 5010 ms. (14 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[207] Max Struct:[3375]
[2024-05-30 15:04:38] [INFO ] Invariant cache hit.
[2024-05-30 15:04:43] [INFO ] [Real]Absence check using 675 positive place invariants in 4050 ms returned sat
[2024-05-30 15:05:05] [INFO ] [Real]Absence check using state equation in 22505 ms returned sat
[2024-05-30 15:05:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 144 ms.
[2024-05-30 15:05:06] [INFO ] Added : 0 causal constraints over 0 iterations in 409 ms. Result :sat
Minimization took 5172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[207] Max Struct:[3375]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[207] Max Struct:[3375]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 61 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 51 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-30 15:05:11] [INFO ] Invariant cache hit.
[2024-05-30 15:05:20] [INFO ] Implicit Places using invariants in 9195 ms returned []
[2024-05-30 15:05:20] [INFO ] Invariant cache hit.
[2024-05-30 15:05:33] [INFO ] Implicit Places using invariants and state equation in 12523 ms returned []
Implicit Place search using SMT with State Equation took 21722 ms to find 0 implicit places.
[2024-05-30 15:05:33] [INFO ] Redundant transitions in 107 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 21886 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14229 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2953 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2781 ms. (14 steps per ms) remains 2/2 properties
Probabilistic random walk after 155343 steps, saw 155289 distinct states, run finished after 15008 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 15:05:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 675/4050 variables, 675/4050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 675/4725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4725 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4265 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 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/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4050/7425 variables, and 4050 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3100 ms.
Refiners :[Domain max(s): 3375/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8093ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 55 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 4050/4050 places, 3375/3375 transitions.
RANDOM walk for 40000 steps (200 resets) in 14643 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3103 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2955 ms. (13 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153344 steps, run timeout after 15022 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 153344 steps, saw 153290 distinct states, run finished after 15033 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-30 15:06:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4050/7425 variables, and 4050 constraints, problems are : Problem set: 1 solved, 1 unsolved in 7326 ms.
Refiners :[Domain max(s): 3375/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 0/4050 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3375 variables, 3375/3375 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3375 variables, 0/3375 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 675/4050 variables, 675/4050 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4050 variables, 675/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4050 variables, 0/4725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7425/7425 variables, and 8775 constraints, problems are : Problem set: 1 solved, 1 unsolved in 20024 ms.
Refiners :[Domain max(s): 4050/4050 constraints, Positive P Invariants (semi-flows): 675/675 constraints, State Equation: 4050/4050 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 28107ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 208 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 28 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[207] Max Struct:[3375]
Ending property specific reduction for Sudoku-PT-AN15-UpperBounds-01 in 267434 ms.
[2024-05-30 15:06:50] [INFO ] Flatten gal took : 310 ms
[2024-05-30 15:06:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2024-05-30 15:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 20 ms.
Total runtime 523276 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-PT-AN15
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4050
TRANSITIONS: 3375
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.075s, Sys 0.013s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 669
MODEL NAME: /home/mcc/execution/412/model
4050 places, 3375 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1717082971376
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
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-PT-AN15"
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-PT-AN15, 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-171690530900685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN15.tgz
mv Sudoku-PT-AN15 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;