About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 106278.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.r161-tall-174881261000279.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 PolyORBLF-PT-S02J06T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-tall-174881261000279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 807K May 29 14:32 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 Liveness
=== Now, execution of the tool begins
BK_START 1748858324103
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202505121319
[2025-06-02 09:58:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-02 09:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:58:45] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-02 09:58:45] [INFO ] Transformed 690 places.
[2025-06-02 09:58:45] [INFO ] Transformed 1434 transitions.
[2025-06-02 09:58:45] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 242 ms.
Discarding 128 transitions out of 1434. Remains 1306
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.18674KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 93 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2025-06-02 09:58:46] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-02 09:58:46] [INFO ] Computed 54 invariants in 98 ms
[2025-06-02 09:58:46] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:03] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:03] [INFO ] Deduced a trap composed of 73 places in 410 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:03] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:04] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:04] [INFO ] Deduced a trap composed of 175 places in 410 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:04] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:05] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:05] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:06] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:06] [INFO ] Deduced a trap composed of 327 places in 425 ms of which 159 ms to minimize.
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 686/1980 variables, and 60 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 60 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41374ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 41406ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41544 ms. Remains : 690/690 places, 1306/1306 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 38 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
[2025-06-02 09:59:27] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-02 09:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:59:27] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-02 09:59:27] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-02 09:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:59:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 09:59:29] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:59:29] [INFO ] Redundant transitions in 87 ms returned []
Running 1304 sub problems to find dead transitions.
[2025-06-02 09:59:29] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-02 09:59:29] [INFO ] Invariant cache hit.
[2025-06-02 09:59:29] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:44] [INFO ] Deduced a trap composed of 73 places in 378 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:45] [INFO ] Deduced a trap composed of 73 places in 384 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:45] [INFO ] Deduced a trap composed of 73 places in 382 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 73 places in 377 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 73 places in 345 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 175 places in 384 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 327 places in 440 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 335 places in 549 ms of which 258 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 54 places in 362 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:51] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:52] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:56] [INFO ] Deduced a trap composed of 343 places in 470 ms of which 180 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/1980 variables, and 66 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/1980 variables, and 66 constraints, problems are : Problem set: 0 solved, 1304 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1304 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60842ms problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 60846ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62868 ms. Remains : 690/690 places, 1306/1306 transitions.
Finished random walk after 5025 steps, including 0 resets, run found a deadlock after 31 ms. (steps per millisecond=162 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 104929 ms.
BK_STOP 1748858430381
--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-PT-S02J06T08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r161-tall-174881261000279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;