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.r246-tall-171654351700472.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 NeoElection-COL-5, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700472
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Apr 11 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 89K May 18 16:43 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 1716680835149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-25 23:47:16] [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-25 23:47:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:47:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 23:47:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:47:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2024-05-25 23:47:17] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2024-05-25 23:47:17] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 25 ms.
[2024-05-25 23:47:17] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 99 ms.
[2024-05-25 23:47:17] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 2866 places in 14 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 193/193 places, 236/236 transitions.
[2024-05-25 23:47:17] [INFO ] Redundant transitions in 9 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-25 23:47:17] [INFO ] Flow matrix only has 220 transitions (discarded 16 similar events)
// Phase 1: matrix 220 rows 193 cols
[2024-05-25 23:47:17] [INFO ] Computed 54 invariants in 17 ms
[2024-05-25 23:47:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 25/193 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 19 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-05-25 23:47:20] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 10 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-25 23:47:21] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:47:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 23:47:23] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 23:47:24] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-25 23:47:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-25 23:47:25] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-05-25 23:47:25] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-25 23:47:26] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-25 23:47:26] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-25 23:47:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-25 23:47:26] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-25 23:47:26] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 9 (OVERLAPS) 220/413 variables, 193/315 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 40/355 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/355 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 12 (OVERLAPS) 0/413 variables, 0/355 constraints. Problems are: Problem set: 4 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 355 constraints, problems are : Problem set: 4 solved, 227 unsolved in 16016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 193/193 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 4 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 47/51 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 25/193 variables, 30/81 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 21/122 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 220/413 variables, 193/315 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 40/355 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 227/582 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/582 constraints. Problems are: Problem set: 4 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/413 variables, 0/582 constraints. Problems are: Problem set: 4 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 582 constraints, problems are : Problem set: 4 solved, 227 unsolved in 12660 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 193/193 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 227/231 constraints, Known Traps: 68/68 constraints]
After SMT, in 28967ms problems are : Problem set: 4 solved, 227 unsolved
Search for dead transitions found 4 dead transitions in 28984ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 193/193 places, 232/236 transitions.
[2024-05-25 23:47:46] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 29114 ms. Remains : 193/193 places, 232/236 transitions.
Final net has 193 places and 232 transitions.
[2024-05-25 23:47:46] [INFO ] Flatten gal took : 53 ms
[2024-05-25 23:47:46] [INFO ] Applying decomposition
[2024-05-25 23:47:46] [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/graph1903350192859624896.txt' '-o' '/tmp/graph1903350192859624896.bin' '-w' '/tmp/graph1903350192859624896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1903350192859624896.bin' '-l' '-1' '-v' '-w' '/tmp/graph1903350192859624896.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:47:46] [INFO ] Decomposing Gal with order
[2024-05-25 23:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:47:46] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-25 23:47:46] [INFO ] Flatten gal took : 45 ms
[2024-05-25 23:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2024-05-25 23:47:46] [INFO ] Time to serialize gal into /tmp/StateSpace16127865154530465287.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/StateSpace16127865154530465287.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,6.35695e+18,776.22,6128372,20267,29885,3.27936e+06,824665,321,2.40524e+07,418,5.93578e+07,0
Total reachable state count : 6356945335486745615

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 49
STATE_SPACE MAX_TOKEN_PER_MARKING 80 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 6356945335486745615
STATE_SPACE STATES 6356945335486745615 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 807780 ms.

BK_STOP 1716681644082

--------------------
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="NeoElection-COL-5"
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 NeoElection-COL-5, 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 r246-tall-171654351700472"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 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 ;