About the Execution of ITS-Tools for DiscoveryGPU-PT-13b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
535.212 | 66310.00 | 89957.00 | 234.30 | 8.6891E+0019 ? 1 15 | 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.r136-tall-171631132800488.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 itstools
Input is DiscoveryGPU-PT-13b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800488
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 02:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 02:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
no data necessary for post analysis
=== Now, execution of the tool begins
BK_START 1716382027163
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 12:47:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 12:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:47:08] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-22 12:47:08] [INFO ] Transformed 380 places.
[2024-05-22 12:47:08] [INFO ] Transformed 404 transitions.
[2024-05-22 12:47:08] [INFO ] Found NUPN structural information;
[2024-05-22 12:47:08] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 173 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 380/380 places, 404/404 transitions.
[2024-05-22 12:47:08] [INFO ] Redundant transitions in 23 ms returned []
Running 403 sub problems to find dead transitions.
// Phase 1: matrix 404 rows 380 cols
[2024-05-22 12:47:08] [INFO ] Computed 15 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 27/380 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 27/395 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 25 ms to minimize.
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 13 ms to minimize.
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 16 ms to minimize.
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-22 12:47:17] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 15 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 23 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 12 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 2 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 6 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 3 ms to minimize.
[2024-05-22 12:47:20] [INFO ] Deduced a trap composed of 218 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 11/426 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 404/784 variables, 380/806 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-22 12:47:29] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-22 12:47:29] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-05-22 12:47:29] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 3/809 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/784 variables, and 809 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30048 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 27/380 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 27/395 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 34/429 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-22 12:47:41] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 404/784 variables, 380/810 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 403/1213 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-22 12:47:50] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 1214 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60600 ms. Remains : 380/380 places, 404/404 transitions.
Final net has 380 places and 404 transitions.
[2024-05-22 12:48:09] [INFO ] Flatten gal took : 93 ms
[2024-05-22 12:48:09] [INFO ] Applying decomposition
[2024-05-22 12:48:09] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9266605294698278625.txt' '-o' '/tmp/graph9266605294698278625.bin' '-w' '/tmp/graph9266605294698278625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9266605294698278625.bin' '-l' '-1' '-v' '-w' '/tmp/graph9266605294698278625.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:48:09] [INFO ] Decomposing Gal with order
[2024-05-22 12:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:48:09] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 12:48:09] [INFO ] Flatten gal took : 109 ms
[2024-05-22 12:48:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-22 12:48:09] [INFO ] Time to serialize gal into /tmp/StateSpace8037131429366522158.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace8037131429366522158.gal' '-t' 'CGAL' '--stats'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.6891e+19,3.33153,106960,6076,47,231862,357,630,300323,54,1051,0
Total reachable state count : 86890956527077054000
Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 15
STATE_SPACE MAX_TOKEN_PER_MARKING 15 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 86890956527077053996
STATE_SPACE STATES 86890956527077053996 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 65025 ms.
BK_STOP 1716382093473
--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DiscoveryGPU-PT-13b"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DiscoveryGPU-PT-13b, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132800488"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;