Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100640.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 LamportFastMutEx-COL-7, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100640
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 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 1748877247414

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202505121319
[2025-06-02 15:14:08] [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-02 15:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:14:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 15:14:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 15:14:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2025-06-02 15:14:09] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 20 ms.
[2025-06-02 15:14:09] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 32 ms.
[2025-06-02 15:14:09] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 219/219 places, 462/462 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:14:09] [INFO ] Redundant transitions in 26 ms returned []
Running 455 sub problems to find dead transitions.
[2025-06-02 15:14:09] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2025-06-02 15:14:09] [INFO ] Computed 65 invariants in 16 ms
[2025-06-02 15:14:09] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 18 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 8 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 7 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:13] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 9 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 5 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 20/85 constraints. Problems are: Problem set: 31 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:16] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:17] [INFO ] Deduced a trap composed of 15 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-02 15:14:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:17] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:17] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:17] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 4 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/105 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:18] [INFO ] Deduced a trap composed of 21 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-02 15:14:18] [INFO ] Deduced a trap composed of 21 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-02 15:14:19] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:19] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:20] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:21] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/125 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:24] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:25] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:26] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:27] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:27] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:27] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:27] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 5/150 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:29] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:29] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:29] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:29] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:29] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:31] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:31] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:32] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:33] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:33] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:33] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 17/167 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:35] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:36] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:37] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:37] [INFO ] Deduced a trap composed of 22 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-02 15:14:37] [INFO ] Deduced a trap composed of 22 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-02 15:14:37] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/187 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:38] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:38] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:38] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:38] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:39] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:39] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:40] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/555 variables, and 194 constraints, problems are : Problem set: 42 solved, 413 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 0/219 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 129/129 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 9/9 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 96/105 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/105 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/219 variables, 56/161 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 33/194 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:43] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:43] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:44] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:44] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/198 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/198 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 336/555 variables, 219/417 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 91/508 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 413/921 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:55] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:55] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:56] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:56] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:14:57] [INFO ] Deduced a trap composed of 22 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-02 15:14:57] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 6/927 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:15:09] [INFO ] Deduced a trap composed of 21 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-02 15:15:09] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 929 constraints, problems are : Problem set: 42 solved, 413 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 413/455 constraints, Known Traps: 141/141 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 60357ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 219/219 places, 420/462 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:15:10] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60521 ms. Remains : 219/219 places, 420/462 transitions.
Final net has 219 places and 420 transitions.
[2025-06-02 15:15:10] [INFO ] Flatten gal took : 64 ms
[2025-06-02 15:15:10] [INFO ] Applying decomposition
[2025-06-02 15:15:10] [INFO ] Flatten gal took : 29 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/graph16172520134634942643.txt' '-o' '/tmp/graph16172520134634942643.bin' '-w' '/tmp/graph16172520134634942643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16172520134634942643.bin' '-l' '-1' '-v' '-w' '/tmp/graph16172520134634942643.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:15:10] [INFO ] Decomposing Gal with order
[2025-06-02 15:15:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:15:10] [INFO ] Removed a total of 657 redundant transitions.
[2025-06-02 15:15:10] [INFO ] Flatten gal took : 75 ms
[2025-06-02 15:15:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 15 ms.
[2025-06-02 15:15:10] [INFO ] Time to serialize gal into /tmp/StateSpace1321882350572876412.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace1321882350572876412.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 ...219
Detected timeout of ITS tools.
[2025-06-02 15:35:33] [INFO ] Applying decomposition
[2025-06-02 15:35:33] [INFO ] Flatten gal took : 318 ms
[2025-06-02 15:35:33] [INFO ] Decomposing Gal with order
[2025-06-02 15:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:35:34] [INFO ] Removed a total of 675 redundant transitions.
[2025-06-02 15:35:34] [INFO ] Flatten gal took : 227 ms
[2025-06-02 15:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 30 ms.
[2025-06-02 15:35:34] [INFO ] Time to serialize gal into /tmp/StateSpace14911704127135635377.gal : 64 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/StateSpace14911704127135635377.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
Detected timeout of ITS tools.
[2025-06-02 15:55:57] [INFO ] Flatten gal took : 362 ms
[2025-06-02 15:55:58] [INFO ] Input system was already deterministic with 420 transitions.
[2025-06-02 15:55:59] [INFO ] Transformed 219 places.
[2025-06-02 15:55:59] [INFO ] Transformed 420 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 15:55:59] [INFO ] Time to serialize gal into /tmp/StateSpace6173687915281798945.gal : 9 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/StateSpace6173687915281798945.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 ...285
Successfully loaded order from file /home/mcc/execution/model.ord

BK_TIME_CONFINEMENT_REACHED

--------------------
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="LamportFastMutEx-COL-7"
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 LamportFastMutEx-COL-7, 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 r114-tall-174876423100640"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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