fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820600222
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for JoinFreeModules-PT-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3258.688 133774.00 166600.00 459.60 TFFFTTFTFTFFTTTT normal

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.r132-tall-165271820600222.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-2000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 9.2K Apr 30 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 02:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 30 02:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 02:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 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 6.2M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654241137725

Running Version 202205111006
[2022-06-03 07:25:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-03 07:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 07:25:39] [INFO ] Load time of PNML (sax parser for PT used): 456 ms
[2022-06-03 07:25:39] [INFO ] Transformed 10001 places.
[2022-06-03 07:25:39] [INFO ] Transformed 16001 transitions.
[2022-06-03 07:25:39] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 11008 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1053 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=10 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=11 ) properties (out of 8) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=11 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=10 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 880 ms. (steps per millisecond=11 ) properties (out of 7) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-06-03 07:25:48] [INFO ] Computed 2000 place invariants in 99 ms
[2022-06-03 07:25:51] [INFO ] [Real]Absence check using 2000 positive place invariants in 606 ms returned sat
[2022-06-03 07:25:51] [INFO ] After 2727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 07:25:53] [INFO ] [Nat]Absence check using 2000 positive place invariants in 640 ms returned sat
[2022-06-03 07:26:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 07:26:16] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 151 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 745 are kept as prefixes of interest. Removing 9255 places using SCC suffix rule.29 ms
Discarding 9255 places :
Also discarding 14808 output transitions
Drop transitions removed 14808 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 745 transition count 1192
Applied a total of 2 rules in 173 ms. Remains 745 /10000 variables (removed 9255) and now considering 1192/16001 (removed 14809) transitions.
// Phase 1: matrix 1192 rows 745 cols
[2022-06-03 07:26:16] [INFO ] Computed 149 place invariants in 7 ms
[2022-06-03 07:26:16] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 745/10000 places, 1192/16001 transitions.
Incomplete random walk after 1000140 steps, including 2 resets, run finished after 6461 ms. (steps per millisecond=154 ) properties (out of 6) seen :3
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 570940 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 695774 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=139 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 1192 rows 745 cols
[2022-06-03 07:26:33] [INFO ] Computed 149 place invariants in 7 ms
[2022-06-03 07:26:33] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 07:26:33] [INFO ] [Nat]Absence check using 149 positive place invariants in 26 ms returned sat
[2022-06-03 07:26:35] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 07:26:35] [INFO ] State equation strengthened by 149 read => feed constraints.
[2022-06-03 07:26:35] [INFO ] After 561ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 11 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-06-03 07:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2022-06-03 07:26:36] [INFO ] After 1705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 909 ms.
[2022-06-03 07:26:37] [INFO ] After 4224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 60002 ms.
Support contains 22 out of 745 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 745/745 places, 1192/1192 transitions.
Graph (complete) has 1788 edges and 745 vertex of which 110 are kept as prefixes of interest. Removing 635 places using SCC suffix rule.1 ms
Discarding 635 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Applied a total of 1 rules in 8 ms. Remains 110 /745 variables (removed 635) and now considering 176/1192 (removed 1016) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/745 places, 176/1192 transitions.
Incomplete random walk after 1000127 steps, including 2 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2013 ms. (steps per millisecond=496 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3124325 steps, run timeout after 9030 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 3124325 steps, saw 2969987 distinct states, run finished after 9031 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 110 cols
[2022-06-03 07:27:50] [INFO ] Computed 22 place invariants in 0 ms
[2022-06-03 07:27:50] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 07:27:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2022-06-03 07:27:50] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 07:27:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-03 07:27:50] [INFO ] After 110ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 07:27:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-03 07:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-03 07:27:50] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2022-06-03 07:27:50] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 209837 steps, including 2 resets, run visited all 1 properties in 666 ms. (steps per millisecond=315 )
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 665 ms.
All properties solved without resorting to model-checking.
Total runtime 132642 ms.

BK_STOP 1654241271499

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 ReachabilityCardinality -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 3600 -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-2000"
export BK_EXAMINATION="ReachabilityCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-2000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820600222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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