About the Execution of ITS-Tools for FireWire-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
663.367 | 50559.00 | 64834.00 | 188.20 | 8.0351E+0006 ? 1 9 | 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.r550-tall-171734898900224.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 FireWire-PT-07, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900224
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 1717360874206
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 20:41:15] [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-06-02 20:41:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:41:15] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 20:41:15] [INFO ] Transformed 126 places.
[2024-06-02 20:41:15] [INFO ] Transformed 396 transitions.
[2024-06-02 20:41:15] [INFO ] Found NUPN structural information;
[2024-06-02 20:41:15] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 185 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 56 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 126/126 places, 340/340 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
[2024-06-02 20:41:15] [INFO ] Redundant transitions in 22 ms returned []
Running 333 sub problems to find dead transitions.
[2024-06-02 20:41:15] [INFO ] Flow matrix only has 310 transitions (discarded 24 similar events)
// Phase 1: matrix 310 rows 126 cols
[2024-06-02 20:41:15] [INFO ] Computed 8 invariants in 24 ms
[2024-06-02 20:41:15] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:41:18] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 13 ms to minimize.
[2024-06-02 20:41:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:41:19] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2024-06-02 20:41:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:41:19] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:41:19] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:41:20] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/311 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 311 constraints, problems are : Problem set: 0 solved, 333 unsolved in 12825 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/311 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 333/644 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:41:44] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/436 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 20:41:51] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 646 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30032 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 9/9 constraints]
After SMT, in 43249ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 43270ms
Starting structural reductions in STATESPACE mode, iteration 1 : 126/126 places, 334/340 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 43407 ms. Remains : 126/126 places, 334/340 transitions.
Final net has 126 places and 334 transitions.
[2024-06-02 20:41:59] [INFO ] Flatten gal took : 65 ms
[2024-06-02 20:41:59] [INFO ] Applying decomposition
[2024-06-02 20:41:59] [INFO ] Flatten gal took : 25 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/graph16065310943526381377.txt' '-o' '/tmp/graph16065310943526381377.bin' '-w' '/tmp/graph16065310943526381377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16065310943526381377.bin' '-l' '-1' '-v' '-w' '/tmp/graph16065310943526381377.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:41:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:41:59] [INFO ] Removed a total of 536 redundant transitions.
[2024-06-02 20:41:59] [INFO ] Flatten gal took : 67 ms
[2024-06-02 20:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 13 ms.
[2024-06-02 20:41:59] [INFO ] Time to serialize gal into /tmp/StateSpace10049079200956416232.gal : 9 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/StateSpace10049079200956416232.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 ...220
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.03512e+06,4.99093,124060,1447,83,154115,935,578,603975,81,4912,0
Total reachable state count : 8035115
Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 9
STATE_SPACE MAX_TOKEN_PER_MARKING 9 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 8035115
STATE_SPACE STATES 8035115 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 49229 ms.
BK_STOP 1717360924765
--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../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="FireWire-PT-07"
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 FireWire-PT-07, 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 r550-tall-171734898900224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 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 ;