fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r226-smll-174903490900216
Last Updated
June 24, 2025

About the Execution of ITS-Tools for StigmergyElection-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 63059.00 0.00 0.00 4411 ? 1 6 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-05a, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 193K May 29 14: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 1749143437671

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-05 17:10:40] [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]
[2025-06-05 17:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:10:40] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2025-06-05 17:10:40] [INFO ] Transformed 72 places.
[2025-06-05 17:10:40] [INFO ] Transformed 450 transitions.
[2025-06-05 17:10:40] [INFO ] Found NUPN structural information;
[2025-06-05 17:10:40] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 340 ms.
Ensure Unique test removed 255 transitions
Reduce redundant transitions removed 307 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 72/72 places, 143/143 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:10:40] [INFO ] Redundant transitions in 8 ms returned []
Running 132 sub problems to find dead transitions.
// Phase 1: matrix 133 rows 72 cols
[2025-06-05 17:10:40] [INFO ] Computed 6 invariants in 16 ms
[2025-06-05 17:10:41] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/72 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:44] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:45] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:46] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:47] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:48] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:48] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:48] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:49] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:50] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:50] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 133/205 variables, 72/189 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 85/274 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:59] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:10:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/205 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:04] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/205 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/205 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 19 (OVERLAPS) 0/205 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 281 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30027 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/72 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 46/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/205 variables, 72/196 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 85/281 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 132/413 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:17] [INFO ] Deduced a trap along path composed of 9 places in 54 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:11:24] [INFO ] Deduced a trap along path composed of 9 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (OVERLAPS) 0/205 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 415 constraints, problems are : Problem set: 0 solved, 132 unsolved in 27859 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 72/72 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 58422ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 58453ms
Starting structural reductions in STATESPACE mode, iteration 1 : 72/72 places, 133/143 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 58690 ms. Remains : 72/72 places, 133/143 transitions.
Final net has 72 places and 133 transitions.
[2025-06-05 17:11:39] [INFO ] Flatten gal took : 67 ms
[2025-06-05 17:11:39] [INFO ] Applying decomposition
[2025-06-05 17:11:39] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8517319436882351359.txt' '-o' '/tmp/graph8517319436882351359.bin' '-w' '/tmp/graph8517319436882351359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8517319436882351359.bin' '-l' '-1' '-v' '-w' '/tmp/graph8517319436882351359.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:11:40] [INFO ] Decomposing Gal with order
[2025-06-05 17:11:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:11:40] [INFO ] Removed a total of 331 redundant transitions.
[2025-06-05 17:11:40] [INFO ] Flatten gal took : 132 ms
[2025-06-05 17:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2025-06-05 17:11:40] [INFO ] Time to serialize gal into /tmp/StateSpace14257567533428738420.gal : 8 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace14257567533428738420.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4411,0.291993,10664,546,42,9291,485,330,38734,53,2235,0
Total reachable state count : 4411

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

BK_STOP 1749143500730

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="StigmergyElection-PT-05a"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05a, 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 r226-smll-174903490900216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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