About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 24499.00 | 0.00 | 0.00 | F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r217-tall-174902002700222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-tall-174902002700222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1749073796500
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2025-06-04 21:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-04 21:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:49:58] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2025-06-04 21:49:58] [INFO ] Transformed 262 places.
[2025-06-04 21:49:58] [INFO ] Transformed 73 transitions.
[2025-06-04 21:49:58] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 180 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 18 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2025-06-04 21:49:58] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:58] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-04 21:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-04 21:49:58] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-04 21:49:58] [INFO ] Invariant cache hit.
[2025-06-04 21:49:58] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:49:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:49:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 7 (OVERLAPS) 73/143 variables, 70/88 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 31/119 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:01] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 120 constraints, problems are : Problem set: 5 solved, 67 unsolved in 5863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 10/13 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 4/67 variables, 1/16 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 2/18 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 73/140 variables, 67/85 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 31/116 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 13/129 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:05] [INFO ] Deduced a trap along path composed of 10 places in 37 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:05] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:50:05] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 3/132 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 67 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 15 (OVERLAPS) 3/143 variables, 3/135 constraints. Problems are: Problem set: 7 solved, 65 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 54/189 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 1/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 19 (OVERLAPS) 0/143 variables, 0/190 constraints. Problems are: Problem set: 9 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 190 constraints, problems are : Problem set: 9 solved, 63 unsolved in 16017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 67/72 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21972ms problems are : Problem set: 9 solved, 63 unsolved
Search for dead transitions found 9 dead transitions in 21988ms
Found 9 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 22855 ms.
BK_STOP 1749073820999
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r217-tall-174902002700222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m04.tgz
mv SieveSingleMsgMbox-PT-d0m04 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;