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.r400-tall-171690532100336.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 StigmergyElection-PT-07a, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100336
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 1717009854301

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-29 19:10:55] [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-29 19:10:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:10:55] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-29 19:10:55] [INFO ] Transformed 100 places.
[2024-05-29 19:10:55] [INFO ] Transformed 2618 transitions.
[2024-05-29 19:10:55] [INFO ] Found NUPN structural information;
[2024-05-29 19:10:55] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 343 ms.
Ensure Unique test removed 2147 transitions
Reduce redundant transitions removed 2251 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 100/100 places, 367/367 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
[2024-05-29 19:10:55] [INFO ] Redundant transitions in 25 ms returned []
Running 352 sub problems to find dead transitions.
// Phase 1: matrix 353 rows 100 cols
[2024-05-29 19:10:55] [INFO ] Computed 8 invariants in 20 ms
[2024-05-29 19:10:56] [INFO ] State equation strengthened by 287 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 8/100 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 10 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:11:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:11:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:11:03] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:11:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:06] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:11:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:11:07] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:11:07] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:11:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:09] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 13 (OVERLAPS) 353/453 variables, 100/306 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 287/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 16 (OVERLAPS) 0/453 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 593 constraints, problems are : Problem set: 0 solved, 352 unsolved in 26559 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 8/100 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 98/206 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:11:25] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 353/453 variables, 100/308 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 287/595 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 352/947 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 947 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30015 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 100/100 constraints]
After SMT, in 58326ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 58350ms
Starting structural reductions in STATESPACE mode, iteration 1 : 100/100 places, 353/367 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 58503 ms. Remains : 100/100 places, 353/367 transitions.
Final net has 100 places and 353 transitions.
[2024-05-29 19:11:54] [INFO ] Flatten gal took : 84 ms
[2024-05-29 19:11:54] [INFO ] Applying decomposition
[2024-05-29 19:11:54] [INFO ] Flatten gal took : 34 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/graph16685655508414306537.txt' '-o' '/tmp/graph16685655508414306537.bin' '-w' '/tmp/graph16685655508414306537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16685655508414306537.bin' '-l' '-1' '-v' '-w' '/tmp/graph16685655508414306537.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:11:54] [INFO ] Decomposing Gal with order
[2024-05-29 19:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:11:54] [INFO ] Removed a total of 1826 redundant transitions.
[2024-05-29 19:11:54] [INFO ] Flatten gal took : 111 ms
[2024-05-29 19:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 18 ms.
[2024-05-29 19:11:54] [INFO ] Time to serialize gal into /tmp/StateSpace2265952259168388450.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/StateSpace2265952259168388450.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,96723,4.50281,119744,3248,35,58718,338,539,1.26062e+06,45,1757,0
Total reachable state count : 96723

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 8
STATE_SPACE MAX_TOKEN_PER_MARKING 8 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 96723
STATE_SPACE STATES 96723 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 64098 ms.

BK_STOP 1717009919512

--------------------
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="StigmergyElection-PT-07a"
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 StigmergyElection-PT-07a, 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 r400-tall-171690532100336"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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