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

About the Execution of LTSMin+red for Sudoku-COL-AN13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14680.479 112014.00 209468.00 360.40 T?????FT?FF????? 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.r536-tall-171690532500506.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 ltsminxred
Input is Sudoku-COL-AN13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717262385074

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:19:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:19:46] [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-06-01 17:19:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:19:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2024-06-01 17:19:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2024-06-01 17:19:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 17:19:46] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
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
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 10 formulas.
FORMULA Sudoku-COL-AN13-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 3 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
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-01 17:19:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 17:19:47] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN13-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:19:47] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-06-01 17:19:47] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 54 ms.
[2024-06-01 17:19:47] [INFO ] Unfolded 12 HLPN properties in 13 ms.
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 51 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 17:19:52] [INFO ] Computed 38 invariants in 125 ms
[2024-06-01 17:19:52] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 17:19:52] [INFO ] Invariant cache hit.
[2024-06-01 17:19:54] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2227 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2024-06-01 17:19:57] [INFO ] Flatten gal took : 1020 ms
[2024-06-01 17:20:07] [INFO ] Flatten gal took : 1465 ms
[2024-06-01 17:20:18] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 10 to 4
RANDOM walk for 40000 steps (268 resets) in 6859 ms. (5 steps per ms) remains 1/4 properties
BEST_FIRST walk for 8004 steps (0 resets) in 20988 ms. (0 steps per ms) remains 1/1 properties
[2024-06-01 17:20:26] [INFO ] Invariant cache hit.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 507/2704 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 0/38 constraints, State Equation: 0/507 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 16394ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-AN13-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:20:48] [INFO ] Flatten gal took : 631 ms
[2024-06-01 17:20:55] [INFO ] Flatten gal took : 1119 ms
[2024-06-01 17:21:02] [INFO ] Input system was already deterministic with 2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:05] [INFO ] Flatten gal took : 87 ms
[2024-06-01 17:21:05] [INFO ] Flatten gal took : 92 ms
[2024-06-01 17:21:05] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:05] [INFO ] Flatten gal took : 82 ms
[2024-06-01 17:21:05] [INFO ] Flatten gal took : 87 ms
[2024-06-01 17:21:06] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:06] [INFO ] Flatten gal took : 123 ms
[2024-06-01 17:21:06] [INFO ] Flatten gal took : 172 ms
[2024-06-01 17:21:06] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 116 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:07] [INFO ] Flatten gal took : 59 ms
[2024-06-01 17:21:07] [INFO ] Flatten gal took : 67 ms
[2024-06-01 17:21:07] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:07] [INFO ] Flatten gal took : 113 ms
[2024-06-01 17:21:07] [INFO ] Flatten gal took : 131 ms
[2024-06-01 17:21:08] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:08] [INFO ] Flatten gal took : 120 ms
[2024-06-01 17:21:08] [INFO ] Flatten gal took : 165 ms
[2024-06-01 17:21:09] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:10] [INFO ] Flatten gal took : 159 ms
[2024-06-01 17:21:11] [INFO ] Flatten gal took : 235 ms
[2024-06-01 17:21:11] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:11] [INFO ] Flatten gal took : 155 ms
[2024-06-01 17:21:12] [INFO ] Flatten gal took : 223 ms
[2024-06-01 17:21:12] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:13] [INFO ] Flatten gal took : 163 ms
[2024-06-01 17:21:13] [INFO ] Flatten gal took : 246 ms
[2024-06-01 17:21:14] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:14] [INFO ] Flatten gal took : 137 ms
[2024-06-01 17:21:14] [INFO ] Flatten gal took : 189 ms
[2024-06-01 17:21:15] [INFO ] Input system was already deterministic with 2197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 507/507 places, 2197/2197 transitions.
[2024-06-01 17:21:15] [INFO ] Flatten gal took : 91 ms
[2024-06-01 17:21:15] [INFO ] Flatten gal took : 128 ms
[2024-06-01 17:21:15] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-06-01 17:21:17] [INFO ] Flatten gal took : 1069 ms
[2024-06-01 17:21:25] [INFO ] Flatten gal took : 1034 ms
[2024-06-01 17:21:32] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 315 ms.
[2024-06-01 17:21:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 2197 transitions and 6591 arcs took 11 ms.
Total runtime 106176 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-01
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-02
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-03
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-04
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-05
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-08
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-11
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-12
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-13
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-14
Could not compute solution for formula : Sudoku-COL-AN13-CTLFireability-2024-15

BK_STOP 1717262497088

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/527/ctl_0_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/527/ctl_1_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/527/ctl_2_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/527/ctl_3_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/527/ctl_4_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/527/ctl_5_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/527/ctl_6_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/527/ctl_7_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/527/ctl_8_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/527/ctl_9_
ctl formula name Sudoku-COL-AN13-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/527/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-AN13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532500506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;