About the Execution of ITS-Tools for Sudoku-PT-AN11
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699100245.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Sudoku-PT-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699100245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 275K Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 297K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 510K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 755K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 26 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 746K Mar 5 18:23 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-AN11-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679193178081
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 02:32:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 02:32:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:32:59] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-19 02:32:59] [INFO ] Transformed 1694 places.
[2023-03-19 02:32:59] [INFO ] Transformed 1331 transitions.
[2023-03-19 02:32:59] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 30 ms.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 02:32:59] [INFO ] Computed 363 place invariants in 34 ms
FORMULA Sudoku-PT-AN11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1541 ms. (steps per millisecond=6 ) properties (out of 4) seen :331
FORMULA Sudoku-PT-AN11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :9
[2023-03-19 02:33:02] [INFO ] Invariant cache hit.
[2023-03-19 02:33:02] [INFO ] [Real]Absence check using 363 positive place invariants in 160 ms returned sat
[2023-03-19 02:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:03] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2023-03-19 02:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:33:04] [INFO ] [Nat]Absence check using 363 positive place invariants in 198 ms returned sat
[2023-03-19 02:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:04] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2023-03-19 02:33:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 79 ms.
[2023-03-19 02:33:05] [INFO ] Added : 0 causal constraints over 0 iterations in 224 ms. Result :sat
Minimization took 249 ms.
[2023-03-19 02:33:05] [INFO ] [Real]Absence check using 363 positive place invariants in 147 ms returned sat
[2023-03-19 02:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:06] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-19 02:33:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:33:06] [INFO ] [Nat]Absence check using 363 positive place invariants in 199 ms returned sat
[2023-03-19 02:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:07] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2023-03-19 02:33:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-19 02:33:07] [INFO ] Added : 0 causal constraints over 0 iterations in 155 ms. Result :sat
Minimization took 245 ms.
[2023-03-19 02:33:08] [INFO ] [Real]Absence check using 363 positive place invariants in 152 ms returned sat
[2023-03-19 02:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:08] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-19 02:33:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:33:09] [INFO ] [Nat]Absence check using 363 positive place invariants in 230 ms returned sat
[2023-03-19 02:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:33:09] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-19 02:33:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-19 02:33:10] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : [1331, 1331, 1331] Max seen :[110, 110, 110]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 91 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 02:33:14] [INFO ] Invariant cache hit.
Finished random walk after 202027 steps, including 1912 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=6 )
Finished Best-First random walk after 172835 steps, including 4 resets, run visited all 3 properties in 5026 ms. (steps per millisecond=34 )
Finished Best-First random walk after 167777 steps, including 3 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=33 )
Finished Best-First random walk after 168134 steps, including 3 resets, run visited all 3 properties in 5002 ms. (steps per millisecond=33 )
[2023-03-19 02:33:59] [INFO ] Invariant cache hit.
[2023-03-19 02:34:44] [INFO ] [Real]Absence check using 363 positive place invariants in 44866 ms returned unknown
[2023-03-19 02:35:29] [INFO ] [Real]Absence check using 363 positive place invariants in 44842 ms returned unknown
[2023-03-19 02:36:14] [INFO ] [Real]Absence check using 363 positive place invariants in 44853 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331, 1331, 1331] Max seen :[121, 121, 121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 42 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 56 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 02:36:14] [INFO ] Invariant cache hit.
[2023-03-19 02:36:15] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-19 02:36:15] [INFO ] Invariant cache hit.
[2023-03-19 02:36:16] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
[2023-03-19 02:36:16] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-19 02:36:16] [INFO ] Invariant cache hit.
[2023-03-19 02:36:17] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3400 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-00
[2023-03-19 02:36:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1019 ms. (steps per millisecond=9 ) properties (out of 1) seen :111
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 1) seen :3
[2023-03-19 02:36:18] [INFO ] Invariant cache hit.
[2023-03-19 02:36:19] [INFO ] [Real]Absence check using 363 positive place invariants in 168 ms returned sat
[2023-03-19 02:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:36:19] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2023-03-19 02:36:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:36:20] [INFO ] [Nat]Absence check using 363 positive place invariants in 228 ms returned sat
[2023-03-19 02:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:36:20] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2023-03-19 02:36:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-19 02:36:21] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[111]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 64 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 02:36:22] [INFO ] Invariant cache hit.
Finished random walk after 298169 steps, including 2822 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 169686 steps, including 3 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=33 )
[2023-03-19 02:36:57] [INFO ] Invariant cache hit.
[2023-03-19 02:37:42] [INFO ] [Real]Absence check using 363 positive place invariants in 44832 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 02:37:42] [INFO ] Invariant cache hit.
[2023-03-19 02:37:43] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-19 02:37:43] [INFO ] Invariant cache hit.
[2023-03-19 02:37:44] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2023-03-19 02:37:44] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-19 02:37:44] [INFO ] Invariant cache hit.
[2023-03-19 02:37:45] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3217 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-00 in 87856 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-05
[2023-03-19 02:37:45] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 1) seen :110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 1) seen :3
[2023-03-19 02:37:46] [INFO ] Invariant cache hit.
[2023-03-19 02:37:47] [INFO ] [Real]Absence check using 363 positive place invariants in 145 ms returned sat
[2023-03-19 02:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:37:47] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-19 02:37:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:37:47] [INFO ] [Nat]Absence check using 363 positive place invariants in 193 ms returned sat
[2023-03-19 02:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:37:48] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-19 02:37:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-19 02:37:48] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[110]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 31 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 02:37:49] [INFO ] Invariant cache hit.
Finished random walk after 289984 steps, including 2745 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 167179 steps, including 3 resets, run visited all 1 properties in 5004 ms. (steps per millisecond=33 )
[2023-03-19 02:38:24] [INFO ] Invariant cache hit.
[2023-03-19 02:39:09] [INFO ] [Real]Absence check using 363 positive place invariants in 44856 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 02:39:09] [INFO ] Invariant cache hit.
[2023-03-19 02:39:10] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-19 02:39:10] [INFO ] Invariant cache hit.
[2023-03-19 02:39:12] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2023-03-19 02:39:12] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 02:39:12] [INFO ] Invariant cache hit.
[2023-03-19 02:39:12] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3133 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-05 in 87458 ms.
Starting property specific reduction for Sudoku-PT-AN11-UpperBounds-07
[2023-03-19 02:39:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 986 ms. (steps per millisecond=10 ) properties (out of 1) seen :110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 1) seen :3
[2023-03-19 02:39:14] [INFO ] Invariant cache hit.
[2023-03-19 02:39:14] [INFO ] [Real]Absence check using 363 positive place invariants in 151 ms returned sat
[2023-03-19 02:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:39:15] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-19 02:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:39:15] [INFO ] [Nat]Absence check using 363 positive place invariants in 196 ms returned sat
[2023-03-19 02:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:39:16] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-19 02:39:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-19 02:39:16] [INFO ] Added : 0 causal constraints over 0 iterations in 165 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : [1331] Max seen :[110]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1694/1694 places, 1331/1331 transitions.
[2023-03-19 02:39:17] [INFO ] Invariant cache hit.
Finished random walk after 295779 steps, including 2798 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=9 )
Finished Best-First random walk after 170801 steps, including 4 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=34 )
[2023-03-19 02:39:52] [INFO ] Invariant cache hit.
[2023-03-19 02:40:37] [INFO ] [Real]Absence check using 363 positive place invariants in 44861 ms returned unknown
Current structural bounds on expressions (after SMT) : [1331] Max seen :[121]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 02:40:37] [INFO ] Invariant cache hit.
[2023-03-19 02:40:37] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-19 02:40:37] [INFO ] Invariant cache hit.
[2023-03-19 02:40:39] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2023-03-19 02:40:39] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 02:40:39] [INFO ] Invariant cache hit.
[2023-03-19 02:40:40] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3160 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Ending property specific reduction for Sudoku-PT-AN11-UpperBounds-07 in 87496 ms.
[2023-03-19 02:40:40] [INFO ] Flatten gal took : 215 ms
[2023-03-19 02:40:40] [INFO ] Applying decomposition
[2023-03-19 02:40:41] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3964189741326577602.txt' '-o' '/tmp/graph3964189741326577602.bin' '-w' '/tmp/graph3964189741326577602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3964189741326577602.bin' '-l' '-1' '-v' '-w' '/tmp/graph3964189741326577602.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:40:41] [INFO ] Decomposing Gal with order
[2023-03-19 02:40:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:40:41] [INFO ] Removed a total of 2299 redundant transitions.
[2023-03-19 02:40:41] [INFO ] Flatten gal took : 177 ms
[2023-03-19 02:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2023-03-19 02:40:42] [INFO ] Time to serialize gal into /tmp/UpperBounds18095990192372318930.gal : 71 ms
[2023-03-19 02:40:42] [INFO ] Time to serialize properties into /tmp/UpperBounds11056214778542161441.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18095990192372318930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11056214778542161441.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds11056214778542161441.prop.
Detected timeout of ITS tools.
[2023-03-19 03:03:45] [INFO ] Flatten gal took : 1022 ms
[2023-03-19 03:04:06] [INFO ] Time to serialize gal into /tmp/UpperBounds18067620717766074722.gal : 48 ms
[2023-03-19 03:04:06] [INFO ] Time to serialize properties into /tmp/UpperBounds17295194993927157637.prop : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18067620717766074722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17295194993927157637.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17295194993927157637.prop.
Detected timeout of ITS tools.
[2023-03-19 03:27:48] [INFO ] Flatten gal took : 794 ms
[2023-03-19 03:27:50] [INFO ] Input system was already deterministic with 1331 transitions.
[2023-03-19 03:27:50] [INFO ] Transformed 1694 places.
[2023-03-19 03:27:50] [INFO ] Transformed 1331 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 03:27:58] [INFO ] Time to serialize gal into /tmp/UpperBounds1303648376831469692.gal : 20 ms
[2023-03-19 03:27:58] [INFO ] Time to serialize properties into /tmp/UpperBounds4375115168874791968.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1303648376831469692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4375115168874791968.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4375115168874791968.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7852664 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16187420 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-AN11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN11, 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 r485-tall-167912699100245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 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 ;