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-171631132900536.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 DoubleExponent-PT-002, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900536
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 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 33K 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 1716385055200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 13:37:36] [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 13:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:37:36] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-22 13:37:36] [INFO ] Transformed 110 places.
[2024-05-22 13:37:36] [INFO ] Transformed 98 transitions.
[2024-05-22 13:37:36] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 136 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 110/110 places, 98/98 transitions.
[2024-05-22 13:37:36] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 110 cols
[2024-05-22 13:37:36] [INFO ] Computed 14 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 12 ms to minimize.
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:37:37] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:37:38] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:38] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:37:38] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 3/110 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:38] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:37:38] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 98/208 variables, 110/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:37:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:37:39] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:37:39] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 3 ms to minimize.
[2024-05-22 13:37:40] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:37:40] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 141 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:41] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:37:41] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
[2024-05-22 13:37:41] [INFO ] Deduced a trap composed of 74 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:37:42] [INFO ] Deduced a trap composed of 67 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:37:42] [INFO ] Deduced a trap composed of 69 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:37:42] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:42] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 13:37:42] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 3/110 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 98/208 variables, 110/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 97/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/208 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 246 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5104 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 25/25 constraints]
After SMT, in 9996ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10009ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 10110 ms. Remains : 110/110 places, 98/98 transitions.
Final net has 110 places and 98 transitions.
[2024-05-22 13:37:46] [INFO ] Flatten gal took : 30 ms
[2024-05-22 13:37:46] [INFO ] Applying decomposition
[2024-05-22 13:37:46] [INFO ] Flatten gal took : 20 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/graph14130031222353516833.txt' '-o' '/tmp/graph14130031222353516833.bin' '-w' '/tmp/graph14130031222353516833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14130031222353516833.bin' '-l' '-1' '-v' '-w' '/tmp/graph14130031222353516833.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:37:46] [INFO ] Decomposing Gal with order
[2024-05-22 13:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:37:46] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-22 13:37:46] [INFO ] Flatten gal took : 36 ms
[2024-05-22 13:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-22 13:37:46] [INFO ] Time to serialize gal into /tmp/StateSpace7164183297089385824.gal : 6 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/StateSpace7164183297089385824.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,3708,0.129759,9716,1473,119,10523,339,385,24260,29,704,0
Total reachable state count : 3708

Max variable value : 16
STATE_SPACE MAX_TOKEN_IN_PLACE 16 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 71
STATE_SPACE MAX_TOKEN_PER_MARKING 71 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 3708
STATE_SPACE STATES 3708 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 10784 ms.

BK_STOP 1716385067099

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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-171631132900536"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;