fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r518-tajo-171654456000302
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PolyORBNT-PT-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4010.899 142226.00 188485.00 139.20 F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654456000302.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654456000302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717270304602

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:31:47] [INFO ] Load time of PNML (sax parser for PT used): 691 ms
[2024-06-01 19:31:47] [INFO ] Transformed 474 places.
[2024-06-01 19:31:47] [INFO ] Transformed 11760 transitions.
[2024-06-01 19:31:47] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 961 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 474/474 places, 11760/11760 transitions.
Ensure Unique test removed 10 places
Ensure Unique test removed 10110 transitions
Reduce isomorphic transitions removed 10110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 10146 rules applied. Total rules applied 10146 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 10172 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 10172 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 10222 place count 413 transition count 1599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10228 place count 410 transition count 1596
Applied a total of 10228 rules in 541 ms. Remains 410 /474 variables (removed 64) and now considering 1596/11760 (removed 10164) transitions.
Running 1585 sub problems to find dead transitions.
[2024-06-01 19:31:48] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2024-06-01 19:31:48] [INFO ] Computed 62 invariants in 124 ms
[2024-06-01 19:31:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1997 variables, and 52 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 20121 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
[2024-06-01 19:32:25] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 19 ms to minimize.
[2024-06-01 19:32:26] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 2 ms to minimize.
[2024-06-01 19:32:37] [INFO ] Deduced a trap composed of 13 places in 527 ms of which 4 ms to minimize.
[2024-06-01 19:32:39] [INFO ] Deduced a trap composed of 72 places in 436 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1997 variables, and 56 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/585 constraints, Known Traps: 4/4 constraints]
After SMT, in 55454ms problems are : Problem set: 0 solved, 1585 unsolved
Search for dead transitions found 0 dead transitions in 55545ms
[2024-06-01 19:32:43] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-06-01 19:32:43] [INFO ] Invariant cache hit.
[2024-06-01 19:32:44] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-06-01 19:32:44] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-06-01 19:32:44] [INFO ] Invariant cache hit.
[2024-06-01 19:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 19:32:48] [INFO ] Implicit Places using invariants and state equation in 3954 ms returned []
Implicit Place search using SMT with State Equation took 4456 ms to find 0 implicit places.
Running 1585 sub problems to find dead transitions.
[2024-06-01 19:32:48] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2024-06-01 19:32:48] [INFO ] Invariant cache hit.
[2024-06-01 19:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1364 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1997 variables, and 53 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 44/44 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
[2024-06-01 19:33:38] [INFO ] Deduced a trap composed of 18 places in 369 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/53 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
At refinement iteration 4 (OVERLAPS) 1/401 variables, 1/54 constraints. Problems are: Problem set: 66 solved, 1519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1997 variables, and 54 constraints, problems are : Problem set: 66 solved, 1519 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/585 constraints, Known Traps: 1/1 constraints]
After SMT, in 78541ms problems are : Problem set: 66 solved, 1519 unsolved
Search for dead transitions found 66 dead transitions in 78571ms
Found 66 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 140259 ms.
ITS solved all properties within timeout

BK_STOP 1717270446828

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J20, 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 r518-tajo-171654456000302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;