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

About the Execution of LTSMin+red for Sudoku-PT-AN04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
286.216 4289.00 11534.00 68.20 TTFFFT???TT??F?? 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-171690532700593.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-PT-AN04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532700593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 40K Apr 12 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 400K Apr 12 11:20 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 22K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 305K Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 12 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 667K Apr 12 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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-PT-AN04-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717268667046

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:04:28] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-01 19:04:28] [INFO ] Transformed 112 places.
[2024-06-01 19:04:28] [INFO ] Transformed 64 transitions.
[2024-06-01 19:04:28] [INFO ] Found NUPN structural information;
[2024-06-01 19:04:28] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-06-01 19:04:28] [INFO ] Computed 48 invariants in 11 ms
[2024-06-01 19:04:28] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 19:04:28] [INFO ] Invariant cache hit.
[2024-06-01 19:04:28] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2024-06-01 19:04:28] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:04:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:04:29] [INFO ] Flatten gal took : 16 ms
[2024-06-01 19:04:29] [INFO ] Input system was already deterministic with 64 transitions.
Reduction of identical properties reduced properties to check from 57 to 56
RANDOM walk for 40000 steps (2780 resets) in 2952 ms. (13 steps per ms) remains 27/56 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
[2024-06-01 19:04:30] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 19 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 112/176 variables, and 160 constraints, problems are : Problem set: 27 solved, 0 unsolved in 291 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 27 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 27 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:04:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 9 ms
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 38 out of 112 places (down from 112) after GAL structural reductions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 3 formulas.
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 11 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 48/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 5 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 3 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 5 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 51 transition count 64
Applied a total of 61 rules in 3 ms. Remains 51 /112 variables (removed 61) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 5 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 57 transition count 64
Applied a total of 55 rules in 3 ms. Remains 57 /112 variables (removed 55) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 51 transition count 64
Applied a total of 61 rules in 3 ms. Remains 51 /112 variables (removed 61) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 49 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 49/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 52 transition count 64
Applied a total of 60 rules in 2 ms. Remains 52 /112 variables (removed 60) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/112 places, 64/64 transitions.
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:30] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:04:31] [INFO ] Input system was already deterministic with 64 transitions.
[2024-06-01 19:04:31] [INFO ] Flatten gal took : 5 ms
[2024-06-01 19:04:31] [INFO ] Flatten gal took : 5 ms
[2024-06-01 19:04:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 19:04:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 1 ms.
Total runtime 2882 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-PT-AN04-CTLCardinality-2024-06
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-07
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-08
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-11
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-12
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-14
Could not compute solution for formula : Sudoku-PT-AN04-CTLCardinality-2024-15

BK_STOP 1717268671335

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/495/ctl_0_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/495/ctl_1_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/495/ctl_2_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/495/ctl_3_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/495/ctl_4_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/495/ctl_5_
ctl formula name Sudoku-PT-AN04-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/495/ctl_6_
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-PT-AN04"
export BK_EXAMINATION="CTLCardinality"
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-PT-AN04, examination is CTLCardinality"
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-171690532700593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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