About the Execution of LoLA for Sudoku-PT-AN06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
83.699 | 357.00 | 100.00 | 0.00 | 36 36 36 36 36 36 36 36 1 1 1 1 1 1 1 1 | 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.r401-tall-171690534800613.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 lola
Input is Sudoku-PT-AN06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r401-tall-171690534800613
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 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 132K 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-AN06-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717151122210
FORMULA Sudoku-PT-AN06-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-00 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-04 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-03 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-07 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-02 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-05 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-06 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-01 36 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-AN06-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
[[35mlola[0m] [1mFINAL RESULTS[0m
[[35mlola[0m] [1m FINISHED FORMULA: CATEGORY VALUE PRODUCED BY[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-00: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-01: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-02: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-03: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-04: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-05: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-06: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-07: BOUND 36 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-08: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-09: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-10: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-11: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-12: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-13: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-14: BOUND 1 state space[0m
[[35mlola[0m] [1m[32mSudoku-PT-AN06-UpperBounds-15: BOUND 1 state space[0m
[[35mlola[0m]
[[35mlola[0m] Time elapsed: 0 secs. Pages in use: 1
BK_STOP 1717151122567
--------------------
content from stderr:
[[35mlola[0m][I] LoLA will run for 3600 seconds at most ([1m[36m--timelimit[0m)
[[35mlola[0m][W] [1m[33munknown unit in memory specification: using default[0m
[[35mlola[0m][I] MEM LIMIT 5
[[35mlola[0m][I] NET
[[35mlola[0m][I] reading [1m[34mnet[0m from [4m[34mmodel.pnml[0m
[[35mlola[0m][I] input: PNML file ([1m[36m--pnmlnet[0m)
[[35mlola[0m][I] reading pnml
[[35mlola[0m][I] PNML file contains place/transition net
[[35mlola[0m][I] closed [1m[34mnet[0m file [4m[34mmodel.pnml[0m
[[35mlola[0m][I] finished parsing
[[35mlola[0m][I] Reading formula.
[[35mlola[0m][I] Using XML format ([1m[36m--xmlformula[0m)
[[35mlola[0m][I] reading XML formula
[[35mlola[0m][I] reading [1m[34mformula[0m from [4m[34mUpperBounds.xml[0m
[[35mlola[0m][I] Rule S: 0 transitions removed,0 places removed
[[35mlola[0m][I] Structural Bound for (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_0_4 + Rows_0_5 + Rows_1_0 + Rows_1_1 + Rows_1_2 + Rows_1_3 + Rows_1_4 + Rows_1_5 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_2_4 + Rows_2_5 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_3_4 + Rows_3_5 + Rows_4_0 + Rows_4_1 + Rows_4_2 + Rows_4_3 + Rows_4_4 + Rows_4_5 + Rows_5_0 + Rows_5_1 + Rows_5_2 + Rows_5_3 + Rows_5_4 + Rows_5_5 <= 0) is 36
[[35mlola[0m][I] Structural Bound for (Columns_0_3 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 53 (type EXCL) for 27 Sudoku-PT-AN06-UpperBounds-09
[[35mlola[0m][I] time limit : 200 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 48 (type FNDP) for 12 Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] Structural Bound for (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_0_4 + Rows_0_5 + Rows_1_0 + Rows_1_1 + Rows_1_2 + Rows_1_3 + Rows_1_4 + Rows_1_5 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_2_4 + Rows_2_5 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_3_4 + Rows_3_5 + Rows_4_0 + Rows_4_1 + Rows_4_2 + Rows_4_3 + Rows_4_4 + Rows_4_5 + Rows_5_0 + Rows_5_1 + Rows_5_2 + Rows_5_3 + Rows_5_4 + Rows_5_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 49 (type EQUN) for 12 Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] Structural Bound for (Cells_2_5 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 51 (type FNDP) for 27 Sudoku-PT-AN06-UpperBounds-09
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 53 (type EXCL) for Sudoku-PT-AN06-UpperBounds-09
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 51 (type FNDP) for Sudoku-PT-AN06-UpperBounds-09 (obsolete)
[[35mlola[0m][I] LAUNCH task # 56 (type EXCL) for 36 Sudoku-PT-AN06-UpperBounds-12
[[35mlola[0m][I] time limit : 211 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 54 (type FNDP) for 36 Sudoku-PT-AN06-UpperBounds-12
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 56 (type EXCL) for Sudoku-PT-AN06-UpperBounds-12
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 54 (type FNDP) for Sudoku-PT-AN06-UpperBounds-12 (obsolete)
[[35mlola[0m][I] LAUNCH task # 59 (type EXCL) for 0 Sudoku-PT-AN06-UpperBounds-00
[[35mlola[0m][I] time limit : 257 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 57 (type FNDP) for 0 Sudoku-PT-AN06-UpperBounds-00
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 59 (type EXCL) for Sudoku-PT-AN06-UpperBounds-00
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 57 (type FNDP) for Sudoku-PT-AN06-UpperBounds-00 (obsolete)
[[35mlola[0m][I] LAUNCH task # 50 (type EXCL) for 12 Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] time limit : 276 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] FINISHED task # 50 (type EXCL) for Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 48 (type FNDP) for Sudoku-PT-AN06-UpperBounds-04 (obsolete)
[[35mlola[0m][W] CANCELED task # 49 (type EQUN) for Sudoku-PT-AN06-UpperBounds-04 (obsolete)
[[35mlola[0m][I] Structural Bound for (Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + Columns_3_4 + Columns_3_5 + Columns_4_0 + Columns_4_1 + Columns_4_2 + Columns_4_3 + Columns_4_4 + Columns_4_5 + Columns_5_0 + Columns_5_1 + Columns_5_2 + Columns_5_3 + Columns_5_4 + Columns_5_5 + Columns_0_0 + Columns_0_1 + Columns_0_2 + Columns_0_3 + Columns_0_4 + Columns_0_5 + Columns_1_0 + Columns_1_1 + Columns_1_2 + Columns_1_3 + Columns_1_4 + Columns_1_5 + Columns_2_0 + Columns_2_1 + Columns_2_2 + Columns_2_3 + Columns_2_4 + Columns_2_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 62 (type EXCL) for 9 Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] time limit : 300 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 60 (type FNDP) for 9 Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 61 (type EQUN) for 9 Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 62 (type EXCL) for Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 60 (type FNDP) for Sudoku-PT-AN06-UpperBounds-03 (obsolete)
[[35mlola[0m][W] CANCELED task # 61 (type EQUN) for Sudoku-PT-AN06-UpperBounds-03 (obsolete)
[[35mlola[0m][I] FINISHED task # 49 (type EQUN) for Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] FINISHED task # 61 (type EQUN) for Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] Structural Bound for (Board_0_3_0 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 65 (type EXCL) for 39 Sudoku-PT-AN06-UpperBounds-13
[[35mlola[0m][I] time limit : 327 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 63 (type FNDP) for 39 Sudoku-PT-AN06-UpperBounds-13
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 64 (type EQUN) for 39 Sudoku-PT-AN06-UpperBounds-13
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] Structural@Findpath: 1 (upper 1 threshold 0
[[35mlola[0m][I] FINISHED task # 51 (type FNDP) for Sudoku-PT-AN06-UpperBounds-09
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
[[35mlola[0m][I] FINISHED task # 48 (type FNDP) for Sudoku-PT-AN06-UpperBounds-04
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] FINISHED task # 65 (type EXCL) for Sudoku-PT-AN06-UpperBounds-13
[[35mlola[0m][I] markings : 2
[[35mlola[0m][I] fired transitions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 63 (type FNDP) for Sudoku-PT-AN06-UpperBounds-13 (obsolete)
[[35mlola[0m][W] CANCELED task # 64 (type EQUN) for Sudoku-PT-AN06-UpperBounds-13 (obsolete)
[[35mlola[0m][I] Structural Bound for (Columns_4_1 <= 0) is 1
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
[[35mlola[0m][I] LAUNCH task # 68 (type EXCL) for 42 Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] time limit : 360 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 66 (type FNDP) for 42 Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 67 (type EQUN) for 42 Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 57 (type FNDP) for Sudoku-PT-AN06-UpperBounds-00
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] FINISHED task # 68 (type EXCL) for Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][I] Structural@Findpath: 1 (upper 1 threshold 0
[[35mlola[0m][W] CANCELED task # 66 (type FNDP) for Sudoku-PT-AN06-UpperBounds-14 (obsolete)
[[35mlola[0m][W] CANCELED task # 67 (type EQUN) for Sudoku-PT-AN06-UpperBounds-14 (obsolete)
[[35mlola[0m][I] FINISHED task # 54 (type FNDP) for Sudoku-PT-AN06-UpperBounds-12
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] Structural Bound for (Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + Columns_3_4 + Columns_3_5 + Columns_4_0 + Columns_4_1 + Columns_4_2 + Columns_4_3 + Columns_4_4 + Columns_4_5 + Columns_5_0 + Columns_5_1 + Columns_5_2 + Columns_5_3 + Columns_5_4 + Columns_5_5 + Columns_0_0 + Columns_0_1 + Columns_0_2 + Columns_0_3 + Columns_0_4 + Columns_0_5 + Columns_1_0 + Columns_1_1 + Columns_1_2 + Columns_1_3 + Columns_1_4 + Columns_1_5 + Columns_2_0 + Columns_2_1 + Columns_2_2 + Columns_2_3 + Columns_2_4 + Columns_2_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 71 (type EXCL) for 21 Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] time limit : 400 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 69 (type FNDP) for 21 Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 70 (type EQUN) for 21 Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 71 (type EXCL) for Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 69 (type FNDP) for Sudoku-PT-AN06-UpperBounds-07 (obsolete)
[[35mlola[0m][W] CANCELED task # 70 (type EQUN) for Sudoku-PT-AN06-UpperBounds-07 (obsolete)
[[35mlola[0m][I] Structural Bound for (Cells_2_4 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 74 (type EXCL) for 33 Sudoku-PT-AN06-UpperBounds-11
[[35mlola[0m][I] time limit : 450 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 72 (type FNDP) for 33 Sudoku-PT-AN06-UpperBounds-11
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 73 (type EQUN) for 33 Sudoku-PT-AN06-UpperBounds-11
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 74 (type EXCL) for Sudoku-PT-AN06-UpperBounds-11
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 72 (type FNDP) for Sudoku-PT-AN06-UpperBounds-11 (obsolete)
[[35mlola[0m][W] CANCELED task # 73 (type EQUN) for Sudoku-PT-AN06-UpperBounds-11 (obsolete)
[[35mlola[0m][I] FINISHED task # 70 (type EQUN) for Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
[[35mlola[0m][I] FINISHED task # 69 (type FNDP) for Sudoku-PT-AN06-UpperBounds-07
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] Structural Bound for (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_0_4 + Rows_0_5 + Rows_1_0 + Rows_1_1 + Rows_1_2 + Rows_1_3 + Rows_1_4 + Rows_1_5 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_2_4 + Rows_2_5 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_3_4 + Rows_3_5 + Rows_4_0 + Rows_4_1 + Rows_4_2 + Rows_4_3 + Rows_4_4 + Rows_4_5 + Rows_5_0 + Rows_5_1 + Rows_5_2 + Rows_5_3 + Rows_5_4 + Rows_5_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 77 (type EXCL) for 6 Sudoku-PT-AN06-UpperBounds-02
[[35mlola[0m][I] time limit : 514 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 75 (type FNDP) for 6 Sudoku-PT-AN06-UpperBounds-02
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 76 (type EQUN) for 6 Sudoku-PT-AN06-UpperBounds-02
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 77 (type EXCL) for Sudoku-PT-AN06-UpperBounds-02
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 75 (type FNDP) for Sudoku-PT-AN06-UpperBounds-02 (obsolete)
[[35mlola[0m][W] CANCELED task # 76 (type EQUN) for Sudoku-PT-AN06-UpperBounds-02 (obsolete)
[[35mlola[0m][I] Structural@Findpath: 1 (upper 1 threshold 0
[[35mlola[0m][I] Structural Bound for (Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + Columns_3_4 + Columns_3_5 + Columns_4_0 + Columns_4_1 + Columns_4_2 + Columns_4_3 + Columns_4_4 + Columns_4_5 + Columns_5_0 + Columns_5_1 + Columns_5_2 + Columns_5_3 + Columns_5_4 + Columns_5_5 + Columns_0_0 + Columns_0_1 + Columns_0_2 + Columns_0_3 + Columns_0_4 + Columns_0_5 + Columns_1_0 + Columns_1_1 + Columns_1_2 + Columns_1_3 + Columns_1_4 + Columns_1_5 + Columns_2_0 + Columns_2_1 + Columns_2_2 + Columns_2_3 + Columns_2_4 + Columns_2_5 <= 0) is 36
[[35mlola[0m][I] FINISHED task # 66 (type FNDP) for Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] LAUNCH task # 80 (type EXCL) for 15 Sudoku-PT-AN06-UpperBounds-05
[[35mlola[0m][I] time limit : 600 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] Structural Bound for (Columns_3_0 + Columns_3_1 + Columns_3_2 + Columns_3_3 + Columns_3_4 + Columns_3_5 + Columns_4_0 + Columns_4_1 + Columns_4_2 + Columns_4_3 + Columns_4_4 + Columns_4_5 + Columns_5_0 + Columns_5_1 + Columns_5_2 + Columns_5_3 + Columns_5_4 + Columns_5_5 + Columns_0_0 + Columns_0_1 + Columns_0_2 + Columns_0_3 + Columns_0_4 + Columns_0_5 + Columns_1_0 + Columns_1_1 + Columns_1_2 + Columns_1_3 + Columns_1_4 + Columns_1_5 + Columns_2_0 + Columns_2_1 + Columns_2_2 + Columns_2_3 + Columns_2_4 + Columns_2_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 78 (type FNDP) for 15 Sudoku-PT-AN06-UpperBounds-05
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] Structural Bound for (Rows_0_0 + Rows_0_1 + Rows_0_2 + Rows_0_3 + Rows_0_4 + Rows_0_5 + Rows_1_0 + Rows_1_1 + Rows_1_2 + Rows_1_3 + Rows_1_4 + Rows_1_5 + Rows_2_0 + Rows_2_1 + Rows_2_2 + Rows_2_3 + Rows_2_4 + Rows_2_5 + Rows_3_0 + Rows_3_1 + Rows_3_2 + Rows_3_3 + Rows_3_4 + Rows_3_5 + Rows_4_0 + Rows_4_1 + Rows_4_2 + Rows_4_3 + Rows_4_4 + Rows_4_5 + Rows_5_0 + Rows_5_1 + Rows_5_2 + Rows_5_3 + Rows_5_4 + Rows_5_5 <= 0) is 36
[[35mlola[0m][I] LAUNCH task # 79 (type EQUN) for 15 Sudoku-PT-AN06-UpperBounds-05
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 80 (type EXCL) for Sudoku-PT-AN06-UpperBounds-05
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][I] FINISHED task # 64 (type EQUN) for Sudoku-PT-AN06-UpperBounds-13
[[35mlola[0m][I] time used : 0
[[35mlola[0m][W] CANCELED task # 78 (type FNDP) for Sudoku-PT-AN06-UpperBounds-05 (obsolete)
[[35mlola[0m][W] CANCELED task # 79 (type EQUN) for Sudoku-PT-AN06-UpperBounds-05 (obsolete)
[[35mlola[0m][I] LAUNCH task # 86 (type EXCL) for 18 Sudoku-PT-AN06-UpperBounds-06
[[35mlola[0m][I] time limit : 720 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 81 (type FNDP) for 3 Sudoku-PT-AN06-UpperBounds-01
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 82 (type EQUN) for 3 Sudoku-PT-AN06-UpperBounds-01
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 84 (type FNDP) for 18 Sudoku-PT-AN06-UpperBounds-06
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 86 (type EXCL) for Sudoku-PT-AN06-UpperBounds-06
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 84 (type FNDP) for Sudoku-PT-AN06-UpperBounds-06 (obsolete)
[[35mlola[0m][I] LAUNCH task # 83 (type EXCL) for 3 Sudoku-PT-AN06-UpperBounds-01
[[35mlola[0m][I] time limit : 900 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] FINISHED task # 83 (type EXCL) for Sudoku-PT-AN06-UpperBounds-01
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 81 (type FNDP) for Sudoku-PT-AN06-UpperBounds-01 (obsolete)
[[35mlola[0m][W] CANCELED task # 82 (type EQUN) for Sudoku-PT-AN06-UpperBounds-01 (obsolete)
[[35mlola[0m][I] Structural Bound for (Rows_3_3 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 89 (type EXCL) for 24 Sudoku-PT-AN06-UpperBounds-08
[[35mlola[0m][I] time limit : 1200 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 87 (type FNDP) for 24 Sudoku-PT-AN06-UpperBounds-08
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 88 (type EQUN) for 24 Sudoku-PT-AN06-UpperBounds-08
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
[[35mlola[0m][I] FINISHED task # 60 (type FNDP) for Sudoku-PT-AN06-UpperBounds-03
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] FINISHED task # 89 (type EXCL) for Sudoku-PT-AN06-UpperBounds-08
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 87 (type FNDP) for Sudoku-PT-AN06-UpperBounds-08 (obsolete)
[[35mlola[0m][W] CANCELED task # 88 (type EQUN) for Sudoku-PT-AN06-UpperBounds-08 (obsolete)
[[35mlola[0m][I] FINISHED task # 67 (type EQUN) for Sudoku-PT-AN06-UpperBounds-14
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
[[35mlola[0m][I] FINISHED task # 78 (type FNDP) for Sudoku-PT-AN06-UpperBounds-05
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] FINISHED task # 82 (type EQUN) for Sudoku-PT-AN06-UpperBounds-01
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] Structural@Findpath: 1 (upper 1 threshold 0
[[35mlola[0m][I] FINISHED task # 72 (type FNDP) for Sudoku-PT-AN06-UpperBounds-11
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] Structural Bound for (Columns_4_4 <= 0) is 1
[[35mlola[0m][I] LAUNCH task # 92 (type EXCL) for 45 Sudoku-PT-AN06-UpperBounds-15
[[35mlola[0m][I] time limit : 1800 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] Structural@Findpath: 1 (upper 1 threshold 0
[[35mlola[0m][I] LAUNCH task # 90 (type FNDP) for 45 Sudoku-PT-AN06-UpperBounds-15
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 91 (type EQUN) for 45 Sudoku-PT-AN06-UpperBounds-15
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 87 (type FNDP) for Sudoku-PT-AN06-UpperBounds-08
[[35mlola[0m][I] tried executions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] FINISHED task # 92 (type EXCL) for Sudoku-PT-AN06-UpperBounds-15
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 90 (type FNDP) for Sudoku-PT-AN06-UpperBounds-15 (obsolete)
[[35mlola[0m][W] CANCELED task # 91 (type EQUN) for Sudoku-PT-AN06-UpperBounds-15 (obsolete)
[[35mlola[0m][I] Structural Bound for (Board_2_0_0 <= 0) is 1
[[35mlola[0m][I] FINISHED task # 76 (type EQUN) for Sudoku-PT-AN06-UpperBounds-02
[[35mlola[0m][I] result : unknown
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 0
[[35mlola[0m][I] LAUNCH task # 95 (type EXCL) for 30 Sudoku-PT-AN06-UpperBounds-10
[[35mlola[0m][I] time limit : 3600 sec
[[35mlola[0m][I] memory limit: 2000 pages
[[35mlola[0m][I] LAUNCH task # 93 (type FNDP) for 30 Sudoku-PT-AN06-UpperBounds-10
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] LAUNCH task # 94 (type EQUN) for 30 Sudoku-PT-AN06-UpperBounds-10
[[35mlola[0m][I] time limit : 32000000 sec
[[35mlola[0m][I] memory limit: 5 pages
[[35mlola[0m][I] FINISHED task # 95 (type EXCL) for Sudoku-PT-AN06-UpperBounds-10
[[35mlola[0m][I] markings : 2
[[35mlola[0m][I] fired transitions : 1
[[35mlola[0m][I] time used : 0
[[35mlola[0m][I] memory pages used : 1
[[35mlola[0m][W] CANCELED task # 93 (type FNDP) for Sudoku-PT-AN06-UpperBounds-10 (obsolete)
[[35mlola[0m][W] CANCELED task # 94 (type EQUN) for Sudoku-PT-AN06-UpperBounds-10 (obsolete)
[[35mlola[0m][I] Portfolio finished: no open formulas
[[35mlola[0m][I] Structural@Findpath: 36 (upper 36 threshold 0
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-AN06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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 lola"
echo " Input is Sudoku-PT-AN06, 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 r401-tall-171690534800613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN06.tgz
mv Sudoku-PT-AN06 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 ;