About the Execution of ITS-Tools for Sudoku-COL-AN16
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16210.724 | 3491870.00 | 0.00 | 34711.70 | ?FFTTTTTTTFFT?TF | 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.r258-tall-165303545400166.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 itstools
Input is Sudoku-COL-AN16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.7K Apr 30 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 11:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:12 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-00
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-01
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-02
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-03
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-04
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-05
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-06
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-07
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-08
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-09
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-10
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-11
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-12
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-13
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-14
FORMULA_NAME Sudoku-COL-AN16-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654270281777
Running Version 202205111006
[2022-06-03 15:31:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-06-03 15:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:31:23] [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.
[2022-06-03 15:31:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-03 15:31:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2022-06-03 15:31:23] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-03 15:31:23] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 9 ms.
[2022-06-03 15:31:23] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
[2022-06-03 15:31:23] [INFO ] Flatten gal took : 14 ms
[2022-06-03 15:31:23] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2022-06-03 15:31:23] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 63 ms.
[2022-06-03 15:31:23] [INFO ] Unfolded 14 HLPN properties in 12 ms.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 6016 ms. (steps per millisecond=1 ) properties (out of 14) seen :10
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2326 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 6099 steps, including 1 resets, run timeout after 5952 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1896 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:31:41] [INFO ] Computed 768 place invariants in 60 ms
[2022-06-03 15:31:52] [INFO ] [Real]Absence check using 768 positive place invariants in 327 ms returned sat
[2022-06-03 15:31:54] [INFO ] After 3500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 15:31:55] [INFO ] [Nat]Absence check using 768 positive place invariants in 272 ms returned sat
[2022-06-03 15:32:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:32:19] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 91 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Interrupted random walk after 50328 steps, including 222 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 48273 steps, including 0 resets, run timeout after 5066 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 23026 steps, including 0 resets, run timeout after 5226 ms. (steps per millisecond=4 ) properties seen 0
Interrupted Best-First random walk after 6098 steps, including 0 resets, run timeout after 5857 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 29726 steps, including 0 resets, run timeout after 5065 ms. (steps per millisecond=5 ) properties seen 0
Interrupted probabilistic random walk after 1372185 steps, run timeout after 153026 ms. (steps per millisecond=8 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 1372185 steps, saw 613087 distinct states, run finished after 153028 ms. (steps per millisecond=8 ) properties seen :2
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Sudoku-COL-AN16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:35:43] [INFO ] Computed 768 place invariants in 23 ms
[2022-06-03 15:35:45] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:35:46] [INFO ] [Nat]Absence check using 768 positive place invariants in 268 ms returned sat
[2022-06-03 15:39:30] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 156 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Interrupted random walk after 74271 steps, including 328 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 48165 steps, including 0 resets, run timeout after 5056 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 29716 steps, including 0 resets, run timeout after 5056 ms. (steps per millisecond=5 ) properties seen 0
Interrupted probabilistic random walk after 1398166 steps, run timeout after 120028 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1398166 steps, saw 639054 distinct states, run finished after 120031 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:42:10] [INFO ] Computed 768 place invariants in 24 ms
[2022-06-03 15:42:12] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:42:13] [INFO ] [Nat]Absence check using 768 positive place invariants in 246 ms returned sat
[2022-06-03 15:45:57] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 52 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:45:57] [INFO ] Computed 768 place invariants in 18 ms
[2022-06-03 15:45:58] [INFO ] Implicit Places using invariants in 838 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:45:58] [INFO ] Computed 768 place invariants in 19 ms
[2022-06-03 15:45:59] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2022-06-03 15:45:59] [INFO ] Redundant transitions in 263 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:45:59] [INFO ] Computed 768 place invariants in 17 ms
[2022-06-03 15:46:01] [INFO ] Dead Transitions using invariants and state equation in 2494 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 100000 steps, including 442 resets, run finished after 26367 ms. (steps per millisecond=3 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:46:28] [INFO ] Computed 768 place invariants in 19 ms
[2022-06-03 15:46:29] [INFO ] [Real]Absence check using 768 positive place invariants in 258 ms returned sat
[2022-06-03 15:48:08] [INFO ] After 100025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 71928 steps, including 318 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 48189 steps, including 0 resets, run timeout after 5061 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 29726 steps, including 0 resets, run timeout after 5075 ms. (steps per millisecond=5 ) properties seen 0
Interrupted probabilistic random walk after 1411184 steps, run timeout after 120006 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1411184 steps, saw 652063 distinct states, run finished after 120007 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:50:48] [INFO ] Computed 768 place invariants in 21 ms
[2022-06-03 15:50:50] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:50:51] [INFO ] [Nat]Absence check using 768 positive place invariants in 267 ms returned sat
[2022-06-03 15:54:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:54:35] [INFO ] After 225032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 150 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 35 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:54:35] [INFO ] Computed 768 place invariants in 13 ms
[2022-06-03 15:54:36] [INFO ] Implicit Places using invariants in 835 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:54:36] [INFO ] Computed 768 place invariants in 14 ms
[2022-06-03 15:54:37] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
[2022-06-03 15:54:37] [INFO ] Redundant transitions in 154 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:54:37] [INFO ] Computed 768 place invariants in 21 ms
[2022-06-03 15:54:39] [INFO ] Dead Transitions using invariants and state equation in 2454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 100000 steps, including 441 resets, run finished after 26284 ms. (steps per millisecond=3 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:55:06] [INFO ] Computed 768 place invariants in 21 ms
[2022-06-03 15:55:06] [INFO ] [Real]Absence check using 768 positive place invariants in 266 ms returned sat
[2022-06-03 15:56:46] [INFO ] After 100014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2663 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Probabilistic random walk after 297641 steps, saw 297544 distinct states, run finished after 6006 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:56:55] [INFO ] Computed 768 place invariants in 18 ms
[2022-06-03 15:56:55] [INFO ] [Real]Absence check using 768 positive place invariants in 271 ms returned sat
[2022-06-03 15:57:20] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.9 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 202 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2649 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Probabilistic random walk after 289962 steps, saw 289864 distinct states, run finished after 6003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-06-03 15:57:29] [INFO ] Computed 47 place invariants in 622 ms
[2022-06-03 15:57:29] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 45 ms returned sat
[2022-06-03 15:57:36] [INFO ] After 6964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:57:36] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 39 ms returned sat
[2022-06-03 15:57:49] [INFO ] After 12768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 70 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 58 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-06-03 15:57:50] [INFO ] Computed 47 place invariants in 363 ms
[2022-06-03 15:57:50] [INFO ] Implicit Places using invariants in 986 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-06-03 15:57:50] [INFO ] Computed 47 place invariants in 264 ms
[2022-06-03 15:57:54] [INFO ] Implicit Places using invariants and state equation in 4004 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
[2022-06-03 15:57:54] [INFO ] Redundant transitions in 204 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-06-03 15:57:55] [INFO ] Computed 47 place invariants in 271 ms
[2022-06-03 15:57:56] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 58 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-06-03 15:57:56] [INFO ] Computed 47 place invariants in 282 ms
[2022-06-03 15:57:56] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 45 ms returned sat
[2022-06-03 15:58:03] [INFO ] After 6987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:58:03] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 44 ms returned sat
[2022-06-03 15:58:16] [INFO ] After 13018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished random walk after 128 steps, including 0 resets, run visited all 1 properties in 68 ms. (steps per millisecond=1 )
Finished random walk after 128 steps, including 0 resets, run visited all 1 properties in 69 ms. (steps per millisecond=1 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Finished random walk after 443 steps, including 1 resets, run visited all 1 properties in 127 ms. (steps per millisecond=3 )
Applied a total of 0 rules in 31 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 15:58:17] [INFO ] Computed 768 place invariants in 16 ms
[2022-06-03 15:58:19] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 15:58:20] [INFO ] [Nat]Absence check using 768 positive place invariants in 313 ms returned sat
[2022-06-03 16:02:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:02:04] [INFO ] After 225037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
[2022-06-03 16:02:04] [INFO ] Flatten gal took : 400 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16035909452450356932
[2022-06-03 16:02:05] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-06-03 16:02:05] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16035909452450356932
Running compilation step : cd /tmp/ltsmin16035909452450356932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 16:02:05] [INFO ] Applying decomposition
[2022-06-03 16:02:05] [INFO ] Flatten gal took : 609 ms
[2022-06-03 16:02:05] [INFO ] Input system was already deterministic with 4096 transitions.
[2022-06-03 16:02:06] [INFO ] Flatten gal took : 515 ms
[2022-06-03 16:02:10] [INFO ] Ran tautology test, simplified 0 / 2 in 4852 ms.
[2022-06-03 16:02:10] [INFO ] BMC solution for property Sudoku-COL-AN16-ReachabilityCardinality-00(UNSAT) depth K=0 took 94 ms
[2022-06-03 16:02:10] [INFO ] BMC solution for property Sudoku-COL-AN16-ReachabilityCardinality-13(UNSAT) depth K=0 took 50 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 4096 rows 4864 cols
[2022-06-03 16:02:12] [INFO ] Computed 768 place invariants in 14 ms
[2022-06-03 16:02:12] [INFO ] Computed 768 place invariants in 16 ms
[2022-06-03 16:02:19] [INFO ] Proved 4864 variables to be positive in 7273 ms
Compilation finished in 25782 ms.
Running link step : cd /tmp/ltsmin16035909452450356932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 147 ms.
Running LTSmin : cd /tmp/ltsmin16035909452450356932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'SudokuCOLAN16ReachabilityCardinality00==true'
[2022-06-03 16:02:41] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15239970076763749057.txt' '-o' '/tmp/graph15239970076763749057.bin' '-w' '/tmp/graph15239970076763749057.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-03 16:02:42] [INFO ] Flatten gal took : 685 ms
[2022-06-03 16:02:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10305769900069733498.gal : 165 ms
[2022-06-03 16:02:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1299581732495593432.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10305769900069733498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1299581732495593432.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1299581732495593432.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1045
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1045 after 207775
BK_STOP 1654273773647
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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=@none -Xss128m -Xms40m -Xmx8192m
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-AN16"
export BK_EXAMINATION="ReachabilityCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545400166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN16.tgz
mv Sudoku-COL-AN16 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;