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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1063.928 14926.00 31379.00 57.80 TTTFFTTTTTTFFTTT 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-171690532500502.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-AN12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532500502
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717262290105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:18:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:18:11] [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:18:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:18:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 526 ms
[2024-06-01 17:18:11] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:18:12] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-06-01 17:18:12] [INFO ] Skeletonized 14 HLPN properties in 2 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
RANDOM walk for 40292 steps (272 resets) in 171 ms. (234 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40292 steps (272 resets) in 74 ms. (537 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 73 ms. (544 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 66 ms. (601 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 28 ms. (1389 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 49 ms. (805 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 63 ms. (629 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40292 steps (272 resets) in 64 ms. (619 steps per ms) remains 7/7 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:18:12] [INFO ] Computed 3 invariants in 5 ms
Problem Sudoku-COL-AN12-ReachabilityCardinality-2024-01 is UNSAT
Problem Sudoku-COL-AN12-ReachabilityCardinality-2024-05 is UNSAT
Problem Sudoku-COL-AN12-ReachabilityCardinality-2024-06 is UNSAT
Problem Sudoku-COL-AN12-ReachabilityCardinality-2024-09 is UNSAT
Problem Sudoku-COL-AN12-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 7 constraints, problems are : Problem set: 5 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 9 constraints, problems are : Problem set: 5 solved, 2 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 5 solved, 2 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Parikh walk visited 2 properties in 14 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 17:18:12] [INFO ] Flatten gal took : 12 ms
[2024-06-01 17:18:12] [INFO ] Flatten gal took : 1 ms
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 )
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-09 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2024-06-01 17:18:12] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 37 ms.
[2024-06-01 17:18:12] [INFO ] Unfolded 14 HLPN properties in 5 ms.
RANDOM walk for 40000 steps (316 resets) in 5843 ms. (6 steps per ms) remains 1/9 properties
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 1/1 properties
// Phase 1: matrix 1728 rows 2160 cols
[2024-06-01 17:18:14] [INFO ] Computed 432 invariants in 32 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1728/1872 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1872 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2160/3888 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1728/1872 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1872 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2160/3888 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 432/432 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3026ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.6 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 92 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 432/2160 places, 1728/1728 transitions.
RANDOM walk for 40000 steps (316 resets) in 4587 ms. (8 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 229022 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 229022 steps, saw 167464 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 17:18:22] [INFO ] Computed 35 invariants in 90 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 285/429 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/432 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/2160 variables, 432/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2160 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2160 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2160/2160 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1376 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 285/429 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/432 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1728/2160 variables, 432/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2160 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2160 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2160/2160 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1322 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 144 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 13668 ms.
ITS solved all properties within timeout

BK_STOP 1717262305031

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN12"
export BK_EXAMINATION="ReachabilityCardinality"
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-AN12, 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 r536-tall-171690532500502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN12.tgz
mv Sudoku-COL-AN12 execution
cd execution
if [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;