About the Execution of LTSMin+red for RERS17pb113-PT-1
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1868.275 | 82029.00 | 107502.00 | 374.80 | FFTFTTTTTTTFFFTT | 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.r520-tall-171662337900118.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 RERS17pb113-PT-1, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337900118
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M 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 RERS17pb113-PT-1-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2023-06
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-12
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-13
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-14
FORMULA_NAME RERS17pb113-PT-1-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717222258176
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:10:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:11:00] [INFO ] Load time of PNML (sax parser for PT used): 673 ms
[2024-06-01 06:11:00] [INFO ] Transformed 639 places.
[2024-06-01 06:11:00] [INFO ] Transformed 31353 transitions.
[2024-06-01 06:11:00] [INFO ] Found NUPN structural information;
[2024-06-01 06:11:00] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 931 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (10 resets) in 3936 ms. (10 steps per ms) remains 3/14 properties
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
[2024-06-01 06:11:02] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-06-01 06:11:02] [INFO ] Computed 25 invariants in 110 ms
[2024-06-01 06:11:02] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 578/628 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 578/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/639 variables, 11/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 11/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 1303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5069 ms.
Refiners :[Domain max(s): 639/639 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem RERS17pb113-PT-1-ReachabilityCardinality-2024-05 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb113-PT-1-ReachabilityCardinality-2023-06 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2023-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 578/628 variables, 13/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 578/641 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 1/642 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 06:11:11] [INFO ] Deduced a trap composed of 49 places in 2711 ms of which 40 ms to minimize.
[2024-06-01 06:11:13] [INFO ] Deduced a trap composed of 65 places in 2439 ms of which 9 ms to minimize.
SMT process timed out in 11325ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 419 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 627/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (10 resets) in 1883 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 16539 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :0 out of 1
Probabilistic random walk after 16539 steps, saw 11029 distinct states, run finished after 3004 ms. (steps per millisecond=5 ) properties seen :0
[2024-06-01 06:11:17] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2024-06-01 06:11:17] [INFO ] Computed 13 invariants in 69 ms
[2024-06-01 06:11:18] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 605/627 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 605/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 1267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21357 ms.
Refiners :[Domain max(s): 627/627 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 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/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 605/627 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 605/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:11:42] [INFO ] Deduced a trap composed of 49 places in 2498 ms of which 5 ms to minimize.
[2024-06-01 06:11:44] [INFO ] Deduced a trap composed of 43 places in 2460 ms of which 4 ms to minimize.
[2024-06-01 06:11:47] [INFO ] Deduced a trap composed of 49 places in 2477 ms of which 3 ms to minimize.
[2024-06-01 06:11:49] [INFO ] Deduced a trap composed of 49 places in 2494 ms of which 4 ms to minimize.
[2024-06-01 06:11:52] [INFO ] Deduced a trap composed of 41 places in 2776 ms of which 4 ms to minimize.
[2024-06-01 06:11:54] [INFO ] Deduced a trap composed of 25 places in 2355 ms of which 4 ms to minimize.
[2024-06-01 06:11:57] [INFO ] Deduced a trap composed of 49 places in 2717 ms of which 4 ms to minimize.
[2024-06-01 06:12:00] [INFO ] Deduced a trap composed of 65 places in 2615 ms of which 3 ms to minimize.
[2024-06-01 06:12:02] [INFO ] Deduced a trap composed of 49 places in 2383 ms of which 3 ms to minimize.
[2024-06-01 06:12:05] [INFO ] Deduced a trap composed of 41 places in 2639 ms of which 4 ms to minimize.
[2024-06-01 06:12:07] [INFO ] Deduced a trap composed of 41 places in 2392 ms of which 3 ms to minimize.
[2024-06-01 06:12:09] [INFO ] Deduced a trap composed of 41 places in 2290 ms of which 3 ms to minimize.
[2024-06-01 06:12:12] [INFO ] Deduced a trap composed of 49 places in 2286 ms of which 3 ms to minimize.
[2024-06-01 06:12:14] [INFO ] Deduced a trap composed of 65 places in 2362 ms of which 4 ms to minimize.
[2024-06-01 06:12:16] [INFO ] Deduced a trap composed of 66 places in 2155 ms of which 3 ms to minimize.
[2024-06-01 06:12:18] [INFO ] Deduced a trap composed of 65 places in 1489 ms of which 2 ms to minimize.
[2024-06-01 06:12:19] [INFO ] Deduced a trap composed of 65 places in 1195 ms of which 2 ms to minimize.
[2024-06-01 06:12:20] [INFO ] Deduced a trap composed of 65 places in 595 ms of which 1 ms to minimize.
Problem RERS17pb113-PT-1-ReachabilityCardinality-2024-15 is UNSAT
FORMULA RERS17pb113-PT-1-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 627/18953 variables, and 658 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40587 ms.
Refiners :[Domain max(s): 627/627 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 18/18 constraints]
After SMT, in 62506ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 80850 ms.
ITS solved all properties within timeout
BK_STOP 1717222340205
--------------------
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="RERS17pb113-PT-1"
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 RERS17pb113-PT-1, 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 r520-tall-171662337900118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-1.tgz
mv RERS17pb113-PT-1 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;