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.r576-smll-171734920000080.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 MedleyA-PT-10, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 107K Jun 2 16:33 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 1717360507945

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 20:35:10] [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-06-02 20:35:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:35:10] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-02 20:35:10] [INFO ] Transformed 149 places.
[2024-06-02 20:35:10] [INFO ] Transformed 340 transitions.
[2024-06-02 20:35:10] [INFO ] Found NUPN structural information;
[2024-06-02 20:35:10] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 470 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 149/149 places, 340/340 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
[2024-06-02 20:35:10] [INFO ] Redundant transitions in 26 ms returned []
Running 333 sub problems to find dead transitions.
// Phase 1: matrix 334 rows 149 cols
[2024-06-02 20:35:10] [INFO ] Computed 12 invariants in 44 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/149 variables, 7/157 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/161 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:18] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 16 ms to minimize.
[2024-06-02 20:35:18] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 4 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-06-02 20:35:19] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:35:20] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:35:21] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:35:21] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 17/178 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:22] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:35:22] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
[2024-06-02 20:35:23] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 8/186 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:27] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:35:27] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:35:28] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 6/192 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/192 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 334/483 variables, 149/341 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:35] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-06-02 20:35:35] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2024-06-02 20:35:36] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:35:36] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 4/345 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:35:39] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/483 variables, and 348 constraints, problems are : Problem set: 64 solved, 269 unsolved in 30036 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 64 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 5/150 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/150 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 7/157 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/161 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 38/199 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 4 ms to minimize.
[2024-06-02 20:35:45] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 3/202 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:48] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/203 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/203 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 334/483 variables, 149/352 constraints. Problems are: Problem set: 64 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 269/621 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:35:57] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:35:59] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:36:00] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:36:00] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2024-06-02 20:36:00] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:36:01] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:36:01] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:36:01] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:36:01] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:36:02] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 10 ms to minimize.
[2024-06-02 20:36:03] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-06-02 20:36:03] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:36:04] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-02 20:36:04] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:36:04] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:36:04] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 20/641 constraints. Problems are: Problem set: 64 solved, 269 unsolved
[2024-06-02 20:36:09] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:36:10] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 4 ms to minimize.
[2024-06-02 20:36:11] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 3 ms to minimize.
[2024-06-02 20:36:11] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 645 constraints, problems are : Problem set: 64 solved, 269 unsolved in 30020 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 269/333 constraints, Known Traps: 66/66 constraints]
After SMT, in 61231ms problems are : Problem set: 64 solved, 269 unsolved
Search for dead transitions found 64 dead transitions in 61275ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 149/149 places, 270/340 transitions.
[2024-06-02 20:36:12] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61524 ms. Remains : 149/149 places, 270/340 transitions.
Final net has 149 places and 270 transitions.
[2024-06-02 20:36:12] [INFO ] Flatten gal took : 141 ms
[2024-06-02 20:36:12] [INFO ] Applying decomposition
[2024-06-02 20:36:12] [INFO ] Flatten gal took : 52 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/graph2033618852231319110.txt' '-o' '/tmp/graph2033618852231319110.bin' '-w' '/tmp/graph2033618852231319110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2033618852231319110.bin' '-l' '-1' '-v' '-w' '/tmp/graph2033618852231319110.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:36:13] [INFO ] Decomposing Gal with order
[2024-06-02 20:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:36:13] [INFO ] Removed a total of 511 redundant transitions.
[2024-06-02 20:36:13] [INFO ] Flatten gal took : 151 ms
[2024-06-02 20:36:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 16 ms.
[2024-06-02 20:36:13] [INFO ] Time to serialize gal into /tmp/StateSpace9932855178679339328.gal : 10 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/StateSpace9932855178679339328.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,9.49448e+07,1.41164,40920,1365,299,48756,1764,574,257604,131,13009,0
Total reachable state count : 94944767

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 9
STATE_SPACE MAX_TOKEN_PER_MARKING 9 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 94944767
STATE_SPACE STATES 94944767 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 64737 ms.

BK_STOP 1717360574901

--------------------
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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r576-smll-171734920000080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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