fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of 2023-gold for Sudoku-COL-AN12

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
438.464 284719.00 303309.00 1448.70 144 144 144 144 144 144 144 144 144 144 144 144 144 144 144 144 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.r417-tall-171690556200311.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 gold2023
Input is Sudoku-COL-AN12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556200311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 11:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717136760248

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 06:26:01] [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]
[2024-05-31 06:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:26:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 06:26:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:26:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 367 ms
[2024-05-31 06:26:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2024-05-31 06:26:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-31 06:26:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:26:02] [INFO ] Computed 3 invariants in 3 ms
FORMULA Sudoku-COL-AN12-UpperBounds-15 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-14 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-13 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-12 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-11 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-09 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-08 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-07 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-06 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-05 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-02 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN12-UpperBounds-00 144 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 06:26:02] [INFO ] Invariant cache hit.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-31 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:26:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 06:26:02] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:26:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 06:26:02] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-31 06:26:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:26:02] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 06:26:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 06:26:02] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [144, 144, 144, 144]
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2024-05-31 06:26:02] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 40 ms.
[2024-05-31 06:26:02] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2201 ms. (steps per millisecond=4 ) properties (out of 4) seen :532
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 4) seen :8
// Phase 1: matrix 1728 rows 2160 cols
[2024-05-31 06:26:06] [INFO ] Computed 432 invariants in 35 ms
[2024-05-31 06:26:07] [INFO ] [Real]Absence check using 432 positive place invariants in 422 ms returned sat
[2024-05-31 06:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:07] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2024-05-31 06:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:09] [INFO ] [Nat]Absence check using 432 positive place invariants in 1047 ms returned sat
[2024-05-31 06:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:10] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2024-05-31 06:26:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-31 06:26:10] [INFO ] Added : 0 causal constraints over 0 iterations in 219 ms. Result :sat
Minimization took 2462 ms.
[2024-05-31 06:26:13] [INFO ] [Real]Absence check using 432 positive place invariants in 412 ms returned sat
[2024-05-31 06:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:14] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2024-05-31 06:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:15] [INFO ] [Nat]Absence check using 432 positive place invariants in 1067 ms returned sat
[2024-05-31 06:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:16] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2024-05-31 06:26:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 62 ms.
[2024-05-31 06:26:17] [INFO ] Added : 0 causal constraints over 0 iterations in 210 ms. Result :sat
Minimization took 2472 ms.
[2024-05-31 06:26:20] [INFO ] [Real]Absence check using 432 positive place invariants in 407 ms returned sat
[2024-05-31 06:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:21] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2024-05-31 06:26:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:22] [INFO ] [Nat]Absence check using 432 positive place invariants in 1070 ms returned sat
[2024-05-31 06:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:23] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2024-05-31 06:26:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 62 ms.
[2024-05-31 06:26:23] [INFO ] Added : 0 causal constraints over 0 iterations in 219 ms. Result :sat
Minimization took 2468 ms.
[2024-05-31 06:26:26] [INFO ] [Real]Absence check using 432 positive place invariants in 406 ms returned sat
[2024-05-31 06:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:27] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2024-05-31 06:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:26:28] [INFO ] [Nat]Absence check using 432 positive place invariants in 1033 ms returned sat
[2024-05-31 06:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:26:29] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2024-05-31 06:26:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 60 ms.
[2024-05-31 06:26:30] [INFO ] Added : 0 causal constraints over 0 iterations in 204 ms. Result :sat
Minimization took 2475 ms.
Current structural bounds on expressions (after SMT) : [144, 144, 144, 144] Max seen :[133, 133, 133, 133]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 126 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-05-31 06:26:32] [INFO ] Invariant cache hit.
Finished random walk after 136137 steps, including 1079 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=4 )
Finished Best-First random walk after 127451 steps, including 1 resets, run visited all 4 properties in 5002 ms. (steps per millisecond=25 )
Finished Best-First random walk after 138918 steps, including 2 resets, run visited all 4 properties in 5009 ms. (steps per millisecond=27 )
Finished Best-First random walk after 129564 steps, including 1 resets, run visited all 4 properties in 5004 ms. (steps per millisecond=25 )
Finished Best-First random walk after 128815 steps, including 1 resets, run visited all 4 properties in 5002 ms. (steps per millisecond=25 )
[2024-05-31 06:27:22] [INFO ] Invariant cache hit.
[2024-05-31 06:27:23] [INFO ] [Real]Absence check using 432 positive place invariants in 500 ms returned sat
[2024-05-31 06:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:24] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2024-05-31 06:27:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:27:25] [INFO ] [Nat]Absence check using 432 positive place invariants in 452 ms returned sat
[2024-05-31 06:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:26] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2024-05-31 06:27:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-31 06:27:26] [INFO ] Added : 0 causal constraints over 0 iterations in 231 ms. Result :sat
Minimization took 3111 ms.
[2024-05-31 06:27:30] [INFO ] [Real]Absence check using 432 positive place invariants in 497 ms returned sat
[2024-05-31 06:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:31] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2024-05-31 06:27:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:27:31] [INFO ] [Nat]Absence check using 432 positive place invariants in 443 ms returned sat
[2024-05-31 06:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:32] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2024-05-31 06:27:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 70 ms.
[2024-05-31 06:27:32] [INFO ] Added : 0 causal constraints over 0 iterations in 217 ms. Result :sat
Minimization took 3106 ms.
[2024-05-31 06:27:36] [INFO ] [Real]Absence check using 432 positive place invariants in 496 ms returned sat
[2024-05-31 06:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:37] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2024-05-31 06:27:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:27:38] [INFO ] [Nat]Absence check using 432 positive place invariants in 442 ms returned sat
[2024-05-31 06:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:39] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2024-05-31 06:27:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-31 06:27:39] [INFO ] Added : 0 causal constraints over 0 iterations in 198 ms. Result :sat
Minimization took 3103 ms.
[2024-05-31 06:27:43] [INFO ] [Real]Absence check using 432 positive place invariants in 495 ms returned sat
[2024-05-31 06:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:44] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2024-05-31 06:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:27:44] [INFO ] [Nat]Absence check using 432 positive place invariants in 434 ms returned sat
[2024-05-31 06:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:45] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2024-05-31 06:27:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-31 06:27:45] [INFO ] Added : 0 causal constraints over 0 iterations in 188 ms. Result :sat
Minimization took 3107 ms.
Current structural bounds on expressions (after SMT) : [144, 144, 144, 144] Max seen :[133, 133, 133, 133]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 41 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 77 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-31 06:27:49] [INFO ] Invariant cache hit.
[2024-05-31 06:27:50] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-31 06:27:50] [INFO ] Invariant cache hit.
[2024-05-31 06:27:52] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 3295 ms to find 0 implicit places.
[2024-05-31 06:27:52] [INFO ] Redundant transitions in 97 ms returned []
[2024-05-31 06:27:52] [INFO ] Invariant cache hit.
[2024-05-31 06:27:53] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4379 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting property specific reduction for Sudoku-COL-AN12-UpperBounds-01
[2024-05-31 06:27:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1296 ms. (steps per millisecond=7 ) properties (out of 1) seen :131
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 1) seen :2
[2024-05-31 06:27:55] [INFO ] Invariant cache hit.
[2024-05-31 06:27:56] [INFO ] [Real]Absence check using 432 positive place invariants in 598 ms returned sat
[2024-05-31 06:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:57] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2024-05-31 06:27:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:27:57] [INFO ] [Nat]Absence check using 432 positive place invariants in 274 ms returned sat
[2024-05-31 06:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:27:58] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2024-05-31 06:27:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 58 ms.
[2024-05-31 06:27:58] [INFO ] Added : 0 causal constraints over 0 iterations in 195 ms. Result :sat
Minimization took 1093 ms.
Current structural bounds on expressions (after SMT) : [1728] Max seen :[131]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 37 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-05-31 06:28:00] [INFO ] Invariant cache hit.
Finished random walk after 225309 steps, including 1787 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 140074 steps, including 2 resets, run visited all 1 properties in 5019 ms. (steps per millisecond=27 )
[2024-05-31 06:28:35] [INFO ] Invariant cache hit.
[2024-05-31 06:28:36] [INFO ] [Real]Absence check using 432 positive place invariants in 419 ms returned unsat
Current structural bounds on expressions (after SMT) : [144] Max seen :[144]
FORMULA Sudoku-COL-AN12-UpperBounds-01 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Sudoku-COL-AN12-UpperBounds-01 in 42786 ms.
Starting property specific reduction for Sudoku-COL-AN12-UpperBounds-03
[2024-05-31 06:28:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1373 ms. (steps per millisecond=7 ) properties (out of 1) seen :131
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 1) seen :2
[2024-05-31 06:28:38] [INFO ] Invariant cache hit.
[2024-05-31 06:28:38] [INFO ] [Real]Absence check using 432 positive place invariants in 609 ms returned sat
[2024-05-31 06:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:28:39] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2024-05-31 06:28:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:28:40] [INFO ] [Nat]Absence check using 432 positive place invariants in 273 ms returned sat
[2024-05-31 06:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:28:41] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2024-05-31 06:28:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-31 06:28:41] [INFO ] Added : 0 causal constraints over 0 iterations in 198 ms. Result :sat
Minimization took 1101 ms.
Current structural bounds on expressions (after SMT) : [1728] Max seen :[131]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-05-31 06:28:43] [INFO ] Invariant cache hit.
Finished random walk after 220411 steps, including 1747 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 139499 steps, including 2 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=27 )
[2024-05-31 06:29:18] [INFO ] Invariant cache hit.
[2024-05-31 06:29:19] [INFO ] [Real]Absence check using 432 positive place invariants in 406 ms returned unsat
Current structural bounds on expressions (after SMT) : [144] Max seen :[144]
FORMULA Sudoku-COL-AN12-UpperBounds-03 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Sudoku-COL-AN12-UpperBounds-03 in 42865 ms.
Starting property specific reduction for Sudoku-COL-AN12-UpperBounds-04
[2024-05-31 06:29:19] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1368 ms. (steps per millisecond=7 ) properties (out of 1) seen :130
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 1) seen :2
[2024-05-31 06:29:20] [INFO ] Invariant cache hit.
[2024-05-31 06:29:21] [INFO ] [Real]Absence check using 432 positive place invariants in 515 ms returned sat
[2024-05-31 06:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:29:22] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2024-05-31 06:29:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:29:23] [INFO ] [Nat]Absence check using 432 positive place invariants in 256 ms returned sat
[2024-05-31 06:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:29:23] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2024-05-31 06:29:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-31 06:29:24] [INFO ] Added : 0 causal constraints over 0 iterations in 200 ms. Result :sat
Minimization took 586 ms.
Current structural bounds on expressions (after SMT) : [1728] Max seen :[130]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 26 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-05-31 06:29:25] [INFO ] Invariant cache hit.
Finished random walk after 220797 steps, including 1753 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 139518 steps, including 2 resets, run visited all 1 properties in 5010 ms. (steps per millisecond=27 )
[2024-05-31 06:30:00] [INFO ] Invariant cache hit.
[2024-05-31 06:30:01] [INFO ] [Real]Absence check using 432 positive place invariants in 421 ms returned unsat
Current structural bounds on expressions (after SMT) : [144] Max seen :[144]
FORMULA Sudoku-COL-AN12-UpperBounds-04 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Sudoku-COL-AN12-UpperBounds-04 in 42220 ms.
Starting property specific reduction for Sudoku-COL-AN12-UpperBounds-10
[2024-05-31 06:30:01] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties (out of 1) seen :130
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 1) seen :2
[2024-05-31 06:30:03] [INFO ] Invariant cache hit.
[2024-05-31 06:30:03] [INFO ] [Real]Absence check using 432 positive place invariants in 512 ms returned sat
[2024-05-31 06:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:30:04] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2024-05-31 06:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:30:05] [INFO ] [Nat]Absence check using 432 positive place invariants in 256 ms returned sat
[2024-05-31 06:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:30:06] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2024-05-31 06:30:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-31 06:30:06] [INFO ] Added : 0 causal constraints over 0 iterations in 188 ms. Result :sat
Minimization took 583 ms.
Current structural bounds on expressions (after SMT) : [1728] Max seen :[130]
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 23 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 2160/2160 places, 1728/1728 transitions.
[2024-05-31 06:30:07] [INFO ] Invariant cache hit.
Finished random walk after 221877 steps, including 1760 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 132460 steps, including 2 resets, run visited all 1 properties in 5006 ms. (steps per millisecond=26 )
[2024-05-31 06:30:42] [INFO ] Invariant cache hit.
[2024-05-31 06:30:43] [INFO ] [Real]Absence check using 432 positive place invariants in 401 ms returned unsat
Current structural bounds on expressions (after SMT) : [144] Max seen :[144]
FORMULA Sudoku-COL-AN12-UpperBounds-10 144 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Sudoku-COL-AN12-UpperBounds-10 in 42165 ms.
[2024-05-31 06:30:43] [INFO ] Flatten gal took : 241 ms
Total runtime 282269 ms.

BK_STOP 1717137044967

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-COL-AN12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Sudoku-COL-AN12, 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 r417-tall-171690556200311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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