fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853300542
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.280 3600000.00 58988.00 100.70 TFFFTTFFTFTTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300542.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Parking-PT-432, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.7K Apr 11 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 11 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 192K Mar 24 05:37 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 Parking-PT-432-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-432-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591153408818

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:03:32] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2020-06-03 03:03:32] [INFO ] Transformed 529 places.
[2020-06-03 03:03:32] [INFO ] Transformed 785 transitions.
[2020-06-03 03:03:32] [INFO ] Found NUPN structural information;
[2020-06-03 03:03:32] [INFO ] Parsed PT model containing 529 places and 785 transitions in 229 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
FORMULA Parking-PT-432-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 158 ms. (steps per millisecond=63 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1]
FORMULA Parking-PT-432-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 457 rows 529 cols
[2020-06-03 03:03:33] [INFO ] Computed 124 place invariants in 30 ms
[2020-06-03 03:03:33] [INFO ] [Real]Absence check using 120 positive place invariants in 91 ms returned sat
[2020-06-03 03:03:33] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:34] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2020-06-03 03:03:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:03:35] [INFO ] [Nat]Absence check using 120 positive place invariants in 264 ms returned sat
[2020-06-03 03:03:35] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 18 ms returned sat
[2020-06-03 03:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:36] [INFO ] [Nat]Absence check using state equation in 1295 ms returned sat
[2020-06-03 03:03:36] [INFO ] State equation strengthened by 108 read => feed constraints.
[2020-06-03 03:03:36] [INFO ] [Nat]Added 108 Read/Feed constraints in 41 ms returned sat
[2020-06-03 03:03:36] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 77 ms.
[2020-06-03 03:03:39] [INFO ] Added : 260 causal constraints over 52 iterations in 3111 ms. Result :unknown
[2020-06-03 03:03:40] [INFO ] [Real]Absence check using 120 positive place invariants in 242 ms returned sat
[2020-06-03 03:03:40] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:41] [INFO ] [Real]Absence check using state equation in 1331 ms returned sat
[2020-06-03 03:03:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:03:42] [INFO ] [Nat]Absence check using 120 positive place invariants in 452 ms returned unsat
[2020-06-03 03:03:43] [INFO ] [Real]Absence check using 120 positive place invariants in 498 ms returned sat
[2020-06-03 03:03:43] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 03:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:45] [INFO ] [Real]Absence check using state equation in 2943 ms returned sat
[2020-06-03 03:03:46] [INFO ] [Real]Added 108 Read/Feed constraints in 40 ms returned sat
[2020-06-03 03:03:46] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 80 ms.
[2020-06-03 03:03:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:03:46] [INFO ] [Nat]Absence check using 120 positive place invariants in 198 ms returned sat
[2020-06-03 03:03:46] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 03:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:49] [INFO ] [Nat]Absence check using state equation in 2301 ms returned sat
[2020-06-03 03:03:49] [INFO ] [Nat]Added 108 Read/Feed constraints in 33 ms returned sat
[2020-06-03 03:03:49] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 111 ms.
[2020-06-03 03:03:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t189 0) (and (and (> t111 0) (< o111 o189)) (or (and (> t0 0) (< o0 o189)) (and (> t107 0) (< o107 o189)) (and (> t108 0) (< o108 o189)) (and (> t193 0) (< o193 o189)) (and (> t194 0) (< o194 o189)) (and (> t195 0) (< o195 o189)) (and (> t196 0) (< o196 o189)))))") while checking expression at index 2
[2020-06-03 03:03:51] [INFO ] [Real]Absence check using 120 positive place invariants in 284 ms returned sat
[2020-06-03 03:03:51] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 03:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:52] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2020-06-03 03:03:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:03:53] [INFO ] [Nat]Absence check using 120 positive place invariants in 101 ms returned sat
[2020-06-03 03:03:53] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 25 ms returned sat
[2020-06-03 03:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:03:55] [INFO ] [Nat]Absence check using state equation in 1857 ms returned sat
[2020-06-03 03:03:55] [INFO ] [Nat]Added 108 Read/Feed constraints in 20 ms returned sat
[2020-06-03 03:03:55] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 51 ms.
[2020-06-03 03:03:57] [INFO ] Added : 240 causal constraints over 48 iterations in 2712 ms. Result :(error "Failed to check-sat")
FORMULA Parking-PT-432-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 48200 steps, including 376 resets, run finished after 455 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 5 out of 529 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 529/529 places, 457/457 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 529 transition count 441
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 513 transition count 441
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 513 transition count 425
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 497 transition count 425
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 497 transition count 425
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 493 transition count 421
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 114 place count 474 transition count 402
Free-agglomeration rule applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 193 place count 474 transition count 323
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 272 place count 395 transition count 323
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 395 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 394 transition count 322
Reduce places removed 79 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 3 with 238 rules applied. Total rules applied 512 place count 315 transition count 163
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 4 with 203 rules applied. Total rules applied 715 place count 156 transition count 119
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 744 place count 127 transition count 119
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 744 place count 127 transition count 82
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 818 place count 90 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 819 place count 90 transition count 82
Applied a total of 819 rules in 535 ms. Remains 90 /529 variables (removed 439) and now considering 82/457 (removed 375) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/529 places, 82/457 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2288 ms. (steps per millisecond=437 ) properties seen :[0, 1, 1]
FORMULA Parking-PT-432-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 219 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=109 )
FORMULA Parking-PT-432-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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="Parking-PT-432"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Parking-PT-432, 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 r174-csrt-158987853300542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 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 ;