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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 26K 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 1717352595973

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 18:23:18] [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 18:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:23:19] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2024-06-02 18:23:19] [INFO ] Transformed 108 places.
[2024-06-02 18:23:19] [INFO ] Transformed 100 transitions.
[2024-06-02 18:23:19] [INFO ] Found NUPN structural information;
[2024-06-02 18:23:19] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 471 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 108/108 places, 100/100 transitions.
[2024-06-02 18:23:19] [INFO ] Redundant transitions in 5 ms returned []
Running 99 sub problems to find dead transitions.
// Phase 1: matrix 100 rows 108 cols
[2024-06-02 18:23:19] [INFO ] Computed 9 invariants in 16 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:21] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 48 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 3 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 3 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 4 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 3 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 3 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 5 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 7 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:27] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:23:27] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:23:27] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:28] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:23:28] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 100/208 variables, 108/270 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 3 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 3 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 16/286 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 3 ms to minimize.
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:23:33] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:23:34] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:23:34] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:23:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/208 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:38] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:23:39] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/208 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/208 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 22 (OVERLAPS) 0/208 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 306 constraints, problems are : Problem set: 0 solved, 99 unsolved in 23357 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/208 variables, 108/307 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 99/406 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 406 constraints, problems are : Problem set: 0 solved, 99 unsolved in 13437 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 82/82 constraints]
After SMT, in 37036ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 37068ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 37292 ms. Remains : 108/108 places, 100/100 transitions.
Final net has 108 places and 100 transitions.
[2024-06-02 18:23:56] [INFO ] Flatten gal took : 82 ms
[2024-06-02 18:23:56] [INFO ] Applying decomposition
[2024-06-02 18:23:56] [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/graph2788298824816507770.txt' '-o' '/tmp/graph2788298824816507770.bin' '-w' '/tmp/graph2788298824816507770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2788298824816507770.bin' '-l' '-1' '-v' '-w' '/tmp/graph2788298824816507770.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:23:57] [INFO ] Decomposing Gal with order
[2024-06-02 18:23:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:23:57] [INFO ] Flatten gal took : 91 ms
[2024-06-02 18:23:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-06-02 18:23:57] [INFO ] Time to serialize gal into /tmp/StateSpace4209394124109384800.gal : 12 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/StateSpace4209394124109384800.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,1.78827e+08,0.187191,6600,453,202,3988,4423,238,5063,123,10997,0
Total reachable state count : 178826879

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 : 178826879
STATE_SPACE STATES 178826879 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 38982 ms.

BK_STOP 1717352637594

--------------------
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-03"
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-03, 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-171734919800024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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