Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r139-tall-165271827500086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0003, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-tall-165271827500086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 9.4K May 10 09:34 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1652737652683

Running Version 202205111006
[2022-05-16 21:47:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 21:47:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 21:47:33] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2022-05-16 21:47:33] [INFO ] Transformed 16 places.
[2022-05-16 21:47:33] [INFO ] Transformed 25 transitions.
[2022-05-16 21:47:33] [INFO ] Parsed PT model containing 16 places and 25 transitions in 138 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.8062KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 15/15 places, 25/25 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 12 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:34] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-16 21:47:34] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 15/15 places, 25/25 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 8 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 21:47:34] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 21:47:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 21:47:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-16 21:47:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 21:47:34] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250001 steps, including 0 resets, run took 958 ms (no deadlock found). (steps per millisecond=1304 )
Random directed walk for 1250003 steps, including 0 resets, run took 752 ms (no deadlock found). (steps per millisecond=1662 )
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:36] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 21:47:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 21:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:47:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 21:47:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:47:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 21:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:47:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 21:47:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 21:47:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-16 21:47:36] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 21:47:36] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 5600 steps, including 174 resets, run took 10 ms. (steps per millisecond=560 )
Random directed walk for 500002 steps, including 0 resets, run took 300 ms (no deadlock found). (steps per millisecond=1666 )
Random walk for 500000 steps, including 0 resets, run took 353 ms (no deadlock found). (steps per millisecond=1416 )
Random directed walk for 500002 steps, including 0 resets, run took 296 ms (no deadlock found). (steps per millisecond=1689 )
Random walk for 500000 steps, including 0 resets, run took 351 ms (no deadlock found). (steps per millisecond=1424 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 15/15 places, 25/25 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 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 21:47:37] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:37] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 21:47:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 21:47:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 21:47:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:37] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-16 21:47:37] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 873 ms (no deadlock found). (steps per millisecond=1431 )
Random directed walk for 1250003 steps, including 0 resets, run took 745 ms (no deadlock found). (steps per millisecond=1677 )
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 21:47:39] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-16 21:47:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 21:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:47:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 21:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:47:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 21:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:47:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 21:47:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 21:47:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 21:47:39] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 21:47:39] [INFO ] Added : 14 causal constraints over 3 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 5600 steps, including 177 resets, run took 11 ms. (steps per millisecond=509 )
Random directed walk for 500001 steps, including 0 resets, run took 294 ms (no deadlock found). (steps per millisecond=1700 )
Random walk for 500000 steps, including 0 resets, run took 347 ms (no deadlock found). (steps per millisecond=1440 )
Random directed walk for 500003 steps, including 0 resets, run took 303 ms (no deadlock found). (steps per millisecond=1650 )
Random walk for 500000 steps, including 0 resets, run took 350 ms (no deadlock found). (steps per millisecond=1428 )
[2022-05-16 21:47:40] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15408886524591297395
[2022-05-16 21:47:40] [INFO ] Applying decomposition
[2022-05-16 21:47:40] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-05-16 21:47:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:47:40] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-05-16 21:47:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:47:40] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-05-16 21:47:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:47:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15408886524591297395
Running compilation step : cd /tmp/ltsmin15408886524591297395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 21:47:40] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12120424893291337621.txt' '-o' '/tmp/graph12120424893291337621.bin' '-w' '/tmp/graph12120424893291337621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12120424893291337621.bin' '-l' '-1' '-v' '-w' '/tmp/graph12120424893291337621.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:47:40] [INFO ] Decomposing Gal with order
[2022-05-16 21:47:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:47:40] [INFO ] Flatten gal took : 33 ms
[2022-05-16 21:47:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 21:47:40] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11403738978077502930.gal : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock11403738978077502930.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...226
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,35937,0.011817,4544,23,27,154,141,54,160,44,276,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,0.013299,4544,1,0,154,264,102,241,148,423,131

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 7184 ms.

BK_STOP 1652737661079

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="ReachabilityDeadlock"
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-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0003, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-tall-165271827500086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;