fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r269-tall-165303553200046
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Sudoku-COL-AN11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
385.315 126648.00 138808.00 399.00 121 121 121 121 121 121 121 121 121 121 121 121 121 121 121 121 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r269-tall-165303553200046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Sudoku-COL-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r269-tall-165303553200046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 7.1K Apr 30 12:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 12:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN11-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653115819931

Running Version 0
[2022-05-21 06:50:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 06:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:50:21] [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.
[2022-05-21 06:50:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 06:50:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 462 ms
[2022-05-21 06:50:21] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2022-05-21 06:50:21] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2022-05-21 06:50:22] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 6 ms.
[2022-05-21 06:50:22] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_13554581754653695092.dot
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 06:50:22] [INFO ] Computed 3 place invariants in 6 ms
FORMULA Sudoku-COL-AN11-UpperBounds-15 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-14 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-13 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-12 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-08 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-05 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-21 06:50:22] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions in 41 ms.
[2022-05-21 06:50:22] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 06:50:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-21 06:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 06:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121]
[2022-05-21 06:50:22] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions in 21 ms.
[2022-05-21 06:50:22] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_12722937029392858920.dot
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2552 ms. (steps per millisecond=3 ) properties (out of 6) seen :666
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :18
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 06:50:27] [INFO ] Computed 363 place invariants in 27 ms
[2022-05-21 06:50:27] [INFO ] [Real]Absence check using 363 positive place invariants in 220 ms returned sat
[2022-05-21 06:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:28] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2022-05-21 06:50:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:28] [INFO ] [Nat]Absence check using 363 positive place invariants in 306 ms returned sat
[2022-05-21 06:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:29] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2022-05-21 06:50:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-21 06:50:29] [INFO ] Added : 0 causal constraints over 0 iterations in 195 ms. Result :sat
Minimization took 3065 ms.
[2022-05-21 06:50:33] [INFO ] [Real]Absence check using 363 positive place invariants in 218 ms returned sat
[2022-05-21 06:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:33] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2022-05-21 06:50:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:34] [INFO ] [Nat]Absence check using 363 positive place invariants in 325 ms returned sat
[2022-05-21 06:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:34] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2022-05-21 06:50:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-21 06:50:35] [INFO ] Added : 0 causal constraints over 0 iterations in 182 ms. Result :sat
Minimization took 3052 ms.
[2022-05-21 06:50:38] [INFO ] [Real]Absence check using 363 positive place invariants in 231 ms returned sat
[2022-05-21 06:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:39] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2022-05-21 06:50:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:39] [INFO ] [Nat]Absence check using 363 positive place invariants in 330 ms returned sat
[2022-05-21 06:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:40] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2022-05-21 06:50:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-21 06:50:40] [INFO ] Added : 0 causal constraints over 0 iterations in 180 ms. Result :sat
Minimization took 3047 ms.
[2022-05-21 06:50:44] [INFO ] [Real]Absence check using 363 positive place invariants in 209 ms returned sat
[2022-05-21 06:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:44] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2022-05-21 06:50:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:45] [INFO ] [Nat]Absence check using 363 positive place invariants in 320 ms returned sat
[2022-05-21 06:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:46] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2022-05-21 06:50:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 92 ms.
[2022-05-21 06:50:46] [INFO ] Added : 0 causal constraints over 0 iterations in 243 ms. Result :sat
Minimization took 3046 ms.
[2022-05-21 06:50:49] [INFO ] [Real]Absence check using 363 positive place invariants in 239 ms returned sat
[2022-05-21 06:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:50] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2022-05-21 06:50:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:51] [INFO ] [Nat]Absence check using 363 positive place invariants in 325 ms returned sat
[2022-05-21 06:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:51] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2022-05-21 06:50:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-21 06:50:52] [INFO ] Added : 0 causal constraints over 0 iterations in 189 ms. Result :sat
Minimization took 3040 ms.
[2022-05-21 06:50:55] [INFO ] [Real]Absence check using 363 positive place invariants in 210 ms returned sat
[2022-05-21 06:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:56] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2022-05-21 06:50:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:50:56] [INFO ] [Nat]Absence check using 363 positive place invariants in 311 ms returned sat
[2022-05-21 06:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:50:57] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2022-05-21 06:50:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-21 06:50:57] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 3040 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121] Max seen :[111, 111, 111, 111, 111, 111]
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 133 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 06:51:00] [INFO ] Computed 363 place invariants in 7 ms
Interrupted random walk after 119320 steps, including 1128 resets, run timeout after 30001 ms. (steps per millisecond=3 ) properties seen :{0=112, 1=112, 2=112, 3=112, 4=112, 5=112}
Interrupted Best-First random walk after 152192 steps, including 3 resets, run timeout after 5016 ms. (steps per millisecond=30 ) properties seen :{0=104, 1=104, 2=104, 3=104, 4=104, 5=104}
Interrupted Best-First random walk after 153811 steps, including 3 resets, run timeout after 5005 ms. (steps per millisecond=30 ) properties seen :{0=107, 1=107, 2=107, 3=107, 4=107, 5=107}
Interrupted Best-First random walk after 155484 steps, including 3 resets, run timeout after 5021 ms. (steps per millisecond=30 ) properties seen :{0=106, 1=106, 2=106, 3=106, 4=106, 5=106}
Interrupted Best-First random walk after 152884 steps, including 3 resets, run timeout after 5006 ms. (steps per millisecond=30 ) properties seen :{0=106, 1=106, 2=106, 3=106, 4=106, 5=106}
Interrupted Best-First random walk after 157155 steps, including 3 resets, run timeout after 5016 ms. (steps per millisecond=31 ) properties seen :{0=107, 1=107, 2=107, 3=107, 4=107, 5=107}
Interrupted Best-First random walk after 155175 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=31 ) properties seen :{0=105, 1=105, 2=105, 3=105, 4=105, 5=105}
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 06:52:00] [INFO ] Computed 363 place invariants in 14 ms
[2022-05-21 06:52:01] [INFO ] [Real]Absence check using 363 positive place invariants in 390 ms returned sat
[2022-05-21 06:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:01] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2022-05-21 06:52:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:02] [INFO ] [Nat]Absence check using 363 positive place invariants in 274 ms returned sat
[2022-05-21 06:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:03] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2022-05-21 06:52:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-21 06:52:03] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 1317 ms.
[2022-05-21 06:52:05] [INFO ] [Real]Absence check using 363 positive place invariants in 344 ms returned sat
[2022-05-21 06:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:05] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2022-05-21 06:52:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:06] [INFO ] [Nat]Absence check using 363 positive place invariants in 270 ms returned sat
[2022-05-21 06:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:06] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2022-05-21 06:52:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-21 06:52:06] [INFO ] Added : 0 causal constraints over 0 iterations in 167 ms. Result :sat
Minimization took 1358 ms.
[2022-05-21 06:52:08] [INFO ] [Real]Absence check using 363 positive place invariants in 375 ms returned sat
[2022-05-21 06:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:09] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2022-05-21 06:52:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:09] [INFO ] [Nat]Absence check using 363 positive place invariants in 277 ms returned sat
[2022-05-21 06:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:10] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2022-05-21 06:52:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-21 06:52:10] [INFO ] Added : 0 causal constraints over 0 iterations in 173 ms. Result :sat
Minimization took 1324 ms.
[2022-05-21 06:52:12] [INFO ] [Real]Absence check using 363 positive place invariants in 362 ms returned sat
[2022-05-21 06:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:13] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2022-05-21 06:52:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:13] [INFO ] [Nat]Absence check using 363 positive place invariants in 276 ms returned sat
[2022-05-21 06:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:14] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2022-05-21 06:52:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 56 ms.
[2022-05-21 06:52:14] [INFO ] Added : 0 causal constraints over 0 iterations in 191 ms. Result :sat
Minimization took 1322 ms.
[2022-05-21 06:52:16] [INFO ] [Real]Absence check using 363 positive place invariants in 366 ms returned sat
[2022-05-21 06:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:17] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2022-05-21 06:52:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:17] [INFO ] [Nat]Absence check using 363 positive place invariants in 273 ms returned sat
[2022-05-21 06:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:18] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2022-05-21 06:52:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-21 06:52:18] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Minimization took 1276 ms.
[2022-05-21 06:52:20] [INFO ] [Real]Absence check using 363 positive place invariants in 361 ms returned sat
[2022-05-21 06:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:20] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2022-05-21 06:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 06:52:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 263 ms returned sat
[2022-05-21 06:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 06:52:21] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2022-05-21 06:52:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-21 06:52:22] [INFO ] Added : 0 causal constraints over 0 iterations in 155 ms. Result :sat
Minimization took 1267 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121] Max seen :[112, 112, 112, 112, 112, 112]
Incomplete Parikh walk after 12100 steps, including 99 resets, run finished after 2252 ms. (steps per millisecond=5 ) properties (out of 6) seen :726 could not realise parikh vector
FORMULA Sudoku-COL-AN11-UpperBounds-11 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-10 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-09 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-07 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653115946579

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-AN11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Sudoku-COL-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 r269-tall-165303553200046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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