Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819600236.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 ParamProductionCell-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819600236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 5.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K 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 68K 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.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1748809867739

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-06-01 20:31:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 20:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 20:31:09] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-01 20:31:09] [INFO ] Transformed 231 places.
[2025-06-01 20:31:09] [INFO ] Transformed 202 transitions.
[2025-06-01 20:31:09] [INFO ] Found NUPN structural information;
[2025-06-01 20:31:09] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 187 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.15434KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 76 rules in 91 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 101 ms. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1912 ms (no deadlock found). (steps per millisecond=653 )
Random directed walk for 1250002 steps, including 0 resets, run took 1311 ms (no deadlock found). (steps per millisecond=953 )
// Phase 1: matrix 164 rows 193 cols
[2025-06-01 20:31:12] [INFO ] Computed 59 invariants in 14 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:12] [INFO ] [Real]Absence check using 35 positive place invariants in 45 ms returned sat
[2025-06-01 20:31:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 79 ms returned sat
[2025-06-01 20:31:13] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2025-06-01 20:31:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-06-01 20:31:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2025-06-01 20:31:13] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-01 20:31:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-01 20:31:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:13] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 5 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-01 20:31:14] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 8 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-01 20:31:14] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 9 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-01 20:31:14] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 22 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-01 20:31:15] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:15] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:16] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:16] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 10 ms to minimize.
[2025-06-01 20:31:16] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2323 ms
[2025-06-01 20:31:16] [INFO ] Computed and/alt/rep : 155/412/155 causal constraints (skipped 7 transitions) in 11 ms.
[2025-06-01 20:31:16] [INFO ] Added : 145 causal constraints over 29 iterations in 753 ms. Result :sat
Parikh directed walk for 33800 steps, including 472 resets, run took 71 ms. (steps per millisecond=476 )
Random directed walk for 500000 steps, including 0 resets, run took 537 ms (no deadlock found). (steps per millisecond=931 )
Random walk for 500000 steps, including 0 resets, run took 672 ms (no deadlock found). (steps per millisecond=744 )
Random directed walk for 500000 steps, including 0 resets, run took 521 ms (no deadlock found). (steps per millisecond=959 )
Random walk for 500000 steps, including 0 resets, run took 648 ms (no deadlock found). (steps per millisecond=771 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 193/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2025-06-01 20:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:19] [INFO ] Implicit Places using invariants in 202 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
[2025-06-01 20:31:19] [INFO ] Actually due to overlaps returned [78, 80, 77, 35, 40, 54, 64, 92, 93, 95, 132, 133, 135, 166, 167, 175, 17, 18, 22, 28, 36, 41, 55, 65, 172, 173, 184, 97, 98, 137, 138, 162, 163]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 204 ms to find 33 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 160/193 places, 164/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 160 transition count 143
Reduce places removed 21 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 139 transition count 143
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 139 transition count 141
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 137 transition count 141
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 135 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 135 transition count 139
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 132 place count 94 transition count 98
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 132 rules in 27 ms. Remains 94 /160 variables (removed 66) and now considering 98/164 (removed 66) transitions.
// Phase 1: matrix 98 rows 94 cols
[2025-06-01 20:31:19] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:19] [INFO ] Implicit Places using invariants in 73 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 88/193 places, 98/164 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 95
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 84 transition count 94
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 8 rules in 15 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2025-06-01 20:31:19] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 20:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:31:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-01 20:31:19] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 3 : 84/193 places, 94/164 transitions.
Finished structural reductions in DEADLOCK mode , in 3 iterations and 549 ms. Remains : 84/193 places, 94/164 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1050 ms (no deadlock found). (steps per millisecond=1190 )
Random directed walk for 1250002 steps, including 0 resets, run took 870 ms (no deadlock found). (steps per millisecond=1436 )
[2025-06-01 20:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:21] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-01 20:31:21] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 20:31:22] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-01 20:31:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:31:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-01 20:31:22] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 20:31:22] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 20:31:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-01 20:31:22] [INFO ] [Nat]Added 67 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:23] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:31:23] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 4 ms to minimize.
[2025-06-01 20:31:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 917 ms
[2025-06-01 20:31:23] [INFO ] Computed and/alt/rep : 92/216/92 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 20:31:23] [INFO ] Added : 74 causal constraints over 15 iterations in 143 ms. Result :sat
Parikh directed walk for 15600 steps, including 268 resets, run took 17 ms. (steps per millisecond=917 )
Random directed walk for 500002 steps, including 0 resets, run took 346 ms (no deadlock found). (steps per millisecond=1445 )
Random walk for 500000 steps, including 0 resets, run took 420 ms (no deadlock found). (steps per millisecond=1190 )
Random directed walk for 500000 steps, including 0 resets, run took 359 ms (no deadlock found). (steps per millisecond=1392 )
Random walk for 500000 steps, including 0 resets, run took 446 ms (no deadlock found). (steps per millisecond=1121 )
[2025-06-01 20:31:25] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14216154451019209961
[2025-06-01 20:31:25] [INFO ] Applying decomposition
[2025-06-01 20:31:25] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2025-06-01 20:31:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:31:25] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2025-06-01 20:31:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:31:25] [INFO ] Flatten gal took : 17 ms
[2025-06-01 20:31:25] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2025-06-01 20:31:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 20:31:25] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14216154451019209961
Running compilation step : cd /tmp/ltsmin14216154451019209961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph9205413450497843360.txt' '-o' '/tmp/graph9205413450497843360.bin' '-w' '/tmp/graph9205413450497843360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9205413450497843360.bin' '-l' '-1' '-v' '-w' '/tmp/graph9205413450497843360.weights' '-q' '0' '-e' '0.001'
[2025-06-01 20:31:25] [INFO ] Decomposing Gal with order
[2025-06-01 20:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 20:31:25] [INFO ] Removed a total of 30 redundant transitions.
[2025-06-01 20:31:25] [INFO ] Flatten gal took : 60 ms
[2025-06-01 20:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-01 20:31:25] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2780614782108287694.gal : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock2780614782108287694.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...234
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46521e+06,0.166659,10792,954,1329,8708,6475,539,8944,303,13673,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,0.281451,13992,1,0,9568,27512,1324,16620,1379,42913,14430

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 16841 ms.

BK_STOP 1748809885817

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ParamProductionCell-PT-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ParamProductionCell-PT-3, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-174876819600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;