Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.0K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 13:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 13:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 13:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 137K Jun 5 20:08 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 1749318079115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CopsAndRobbers-PT-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-06-07 17:41:20] [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-07 17:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:41:20] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2025-06-07 17:41:20] [INFO ] Transformed 135 places.
[2025-06-07 17:41:20] [INFO ] Transformed 179 transitions.
[2025-06-07 17:41:20] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 154 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 4 ms.14616KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 135/135 places, 179/179 transitions.
Computed a total of 4 stabilizing places and 51 stable transitions
Graph (complete) has 810 edges and 135 vertex of which 110 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.5 ms
Discarding 25 places :
Also discarding 0 output transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 110 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 178
Computed a total of 4 stabilizing places and 51 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 177
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Applied a total of 5 rules in 52 ms. Remains 108 /135 variables (removed 27) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 108 cols
[2025-06-07 17:41:20] [INFO ] Computed 28 invariants in 19 ms
[2025-06-07 17:41:20] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 19940 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40131ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40146ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40236 ms. Remains : 108/135 places, 177/179 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1394 ms (no deadlock found). (steps per millisecond=896 )
Random directed walk for 1250001 steps, including 0 resets, run took 1220 ms (no deadlock found). (steps per millisecond=1024 )
[2025-06-07 17:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-07 17:42:03] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2025-06-07 17:42:03] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-07 17:42:03] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-07 17:42:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-07 17:42:03] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2025-06-07 17:42:03] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:42:03] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-07 17:42:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 17:42:03] [INFO ] [Nat]Added 50 Read/Feed constraints in 31 ms returned sat
[2025-06-07 17:42:03] [INFO ] Computed and/alt/rep : 75/225/75 causal constraints (skipped 52 transitions) in 11 ms.
[2025-06-07 17:42:04] [INFO ] Added : 22 causal constraints over 5 iterations in 141 ms. Result :sat
Parikh directed walk for 7200 steps, including 237 resets, run took 54 ms. (steps per millisecond=133 )
Random directed walk for 500000 steps, including 0 resets, run took 494 ms (no deadlock found). (steps per millisecond=1012 )
Random walk for 500001 steps, including 0 resets, run took 473 ms (no deadlock found). (steps per millisecond=1057 )
Random directed walk for 500000 steps, including 0 resets, run took 476 ms (no deadlock found). (steps per millisecond=1050 )
Random walk for 500002 steps, including 0 resets, run took 470 ms (no deadlock found). (steps per millisecond=1063 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 108/108 places, 177/177 transitions.
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Applied a total of 0 rules in 10 ms. Remains 108 /108 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2025-06-07 17:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:06] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 17:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 17:42:07] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:42:07] [INFO ] Redundant transitions in 10 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-07 17:42:07] [INFO ] Invariant cache hit.
[2025-06-07 17:42:07] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 18391 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48452ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 48453ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 50154 ms. Remains : 108/108 places, 177/177 transitions.
Random walk for 1250001 steps, including 0 resets, run took 1165 ms (no deadlock found). (steps per millisecond=1072 )
Random directed walk for 1250000 steps, including 0 resets, run took 1167 ms (no deadlock found). (steps per millisecond=1071 )
[2025-06-07 17:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-07 17:42:58] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2025-06-07 17:42:58] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:42:58] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-07 17:42:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-07 17:42:58] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2025-06-07 17:42:58] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 17:42:59] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-07 17:42:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 17:42:59] [INFO ] [Nat]Added 50 Read/Feed constraints in 26 ms returned sat
[2025-06-07 17:42:59] [INFO ] Computed and/alt/rep : 75/225/75 causal constraints (skipped 52 transitions) in 12 ms.
[2025-06-07 17:42:59] [INFO ] Added : 22 causal constraints over 5 iterations in 144 ms. Result :sat
Parikh directed walk for 7200 steps, including 228 resets, run took 22 ms. (steps per millisecond=327 )
Random directed walk for 500000 steps, including 0 resets, run took 460 ms (no deadlock found). (steps per millisecond=1086 )
Random walk for 500000 steps, including 0 resets, run took 458 ms (no deadlock found). (steps per millisecond=1091 )
Random directed walk for 500001 steps, including 0 resets, run took 469 ms (no deadlock found). (steps per millisecond=1066 )
Random walk for 500000 steps, including 0 resets, run took 468 ms (no deadlock found). (steps per millisecond=1068 )
[2025-06-07 17:43:01] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15481874892679541455
[2025-06-07 17:43:01] [INFO ] Applying decomposition
[2025-06-07 17:43:01] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2025-06-07 17:43:01] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:43:01] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 17:43:01] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2025-06-07 17:43:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 17:43:01] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2025-06-07 17:43:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 17:43:01] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15481874892679541455
Running compilation step : cd /tmp/ltsmin15481874892679541455;'/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/graph12687866855240981875.txt' '-o' '/tmp/graph12687866855240981875.bin' '-w' '/tmp/graph12687866855240981875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12687866855240981875.bin' '-l' '-1' '-v' '-w' '/tmp/graph12687866855240981875.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:43:01] [INFO ] Decomposing Gal with order
[2025-06-07 17:43:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:43:01] [INFO ] Removed a total of 146 redundant transitions.
[2025-06-07 17:43:01] [INFO ] Flatten gal took : 56 ms
[2025-06-07 17:43:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 9 ms.
[2025-06-07 17:43:01] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10819719675904226823.gal : 5 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/ReachabilityDeadlock10819719675904226823.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 -...235
No direction supplied, using forward translation only.
Compilation finished in 589 ms.
Running link step : cd /tmp/ltsmin15481874892679541455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15481874892679541455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
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.28528e+06,1.76577,49332,1624,152,66178,5810,311,225042,39,32201,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,15625,2.01592,49332,437,40,66178,5921,902,225042,154,32201,34910

System contains 15625 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 15625 states ] showing 10 first states
[ i14={[ u26={[ pl_robber_absent_n22=1 ]
} u25={[ pl_robber_here_n21=1 pl_end_n21=1 ]
} ]
} i15={[ u28={[ pl_robber_absent_n24=1 ]
} u27={[ pl_robber_absent_n23=1 ]
} ]
} i13={[ u24={[ pl_robber_absent_n20=1 ]
} u23={[ pl_robber_absent_n19=1 ]
} ]
} i12={[ u22={[ pl_robber_absent_n18=1 ]
} u21={[ pl_robber_absent_n17=1 ]
} ]
} i11={[ u20={[ pl_robber_absent_n16=1 ]
} u19={[ pl_robber_absent_n15=1 ]
} ]
} u4={[ ]
} i10={[ u18={[ pl_robber_absent_n14=1 ]
} u17={[ pl_robber_absent_n13=1 ]
} u16={[ pl_robber_absent_n12=1 ]
} ]
} i9={[ u15={[ pl_robber_absent_n11=1 ]
} u14={[ pl_robber_absent_n10=1 ]
} ]
} u2={[ pl_start_cops=1 pl_awaiting=2 ]
} u3={[ ]
} i8={[ u13={[ pl_robber_absent_n9=1 ]
} u12={[ pl_robber_absent_n8=1 ]
} ]
} u1={[ ]
} i7={[ u11={[ pl_robber_absent_n7=1 ]
} u10={[ pl_robber_absent_n6=1 ]
} ]
} i5={[ u29={[ pl_robber_absent_n25=1 ]
} u6={[ pl_robber_absent_n2=1 ]
} u5={[ pl_robber_absent_n1=1 ]
} ]
} u0={[ ]
} i6={[ u9={[ pl_robber_absent_n5=1 pl_incoming_cops_n5=1 ]
} u8={[ pl_robber_absent_n4=1 pl_incoming_cops_n4=1 ]
} u7={[ pl_robber_absent_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 pl_incoming_cops_n5=1 ]
} u8={[ pl_robber_absent_n4=1 ]
} u7={[ pl_robber_absent_n3=1 pl_incoming_cops_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 ]
} u8={[ pl_robber_absent_n4=1 pl_incoming_cops_n4=1 ]
} u7={[ pl_robber_absent_n3=1 pl_incoming_cops_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 ]
} u8={[ pl_robber_absent_n4=1 ]
} u7={[ pl_robber_absent_n3=1 pl_incoming_cops_n3=2 ]
} ]
[ u9={[ pl_robber_absent_n5=1 ]
} u8={[ pl_robber_absent_n4=1 pl_incoming_cops_n4=2 ]
} u7={[ pl_robber_absent_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 pl_incoming_cops_n5=2 ]
} u8={[ pl_robber_absent_n4=1 ]
} u7={[ pl_robber_absent_n3=1 ]
} ]
} ]
[ i14={[ u26={[ pl_robber_absent_n22=1 ]
} u25={[ pl_robber_here_n21=1 pl_end_n21=1 ]
} ]
} i15={[ u28={[ pl_robber_absent_n24=1 ]
} u27={[ pl_robber_absent_n23=1 ]
} ]
} i13={[ u24={[ pl_robber_absent_n20=1 ]
} u23={[ pl_robber_absent_n19=1 ]
} ]
} i12={[ u22={[ pl_robber_absent_n18=1 ]
} u21={[ pl_robber_absent_n17=1 ]
} ]
} i11={[ u20={[ pl_robber_absent_n16=1 ]
} u19={[ pl_robber_absent_n15=1 ]
} ]
} u4={[ ]
} i10={[ u18={[ pl_robber_absent_n14=1 ]
} u17={[ pl_robber_absent_n13=1 ]
} u16={[ pl_robber_absent_n12=1 ]
} ]
} i9={[ u15={[ pl_robber_absent_n11=1 ]
} u14={[ pl_robber_absent_n10=1 ]
} ]
} u2={[ pl_start_cops=1 pl_awaiting=2 ]
} u3={[ ]
} i8={[ u13={[ pl_robber_absent_n9=1 ]
} u12={[ pl_robber_absent_n8=1 ]
} ]
} u1={[ ]
} i7={[ u11={[ pl_robber_absent_n7=1 ]
} u10={[ pl_robber_absent_n6=1 ]
} ]
} i5={[ u29={[ pl_robber_absent_n25=1 pl_incoming_cops_n25=1 ]
} u6={[ pl_robber_absent_n2=1 ]
} u5={[ pl_robber_absent_n1=1 ]
} ]
[ u29={[ pl_robber_absent_n25=1 ]
} u6={[ pl_robber_absent_n2=1 pl_incoming_cops_n2=1 ]
} u5={[ pl_robber_absent_n1=1 ]
} ]
[ u29={[ pl_robber_absent_n25=1 ]
} u6={[ pl_robber_absent_n2=1 ]
} u5={[ pl_robber_absent_n1=1 pl_incoming_cops_n1=1 ]
} ]
} u0={[ ]
} i6={[ u9={[ pl_robber_absent_n5=1 pl_incoming_cops_n5=1 ]
} u8={[ pl_robber_absent_n4=1 ]
} u7={[ pl_robber_absent_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 ]
} u8={[ pl_robber_absent_n4=1 pl_incoming_cops_n4=1 ]
} u7={[ pl_robber_absent_n3=1 ]
} ]
[ u9={[ pl_robber_absent_n5=1 ]
} u8={[ pl_robber_absent_n4=1 ]
} u7={[ pl_robber_absent_n3=1 pl_incoming_cops_n3=1 ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 105324 ms.

BK_STOP 1749318185597

--------------------
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="CopsAndRobbers-PT-CRL025X003"
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 CopsAndRobbers-PT-CRL025X003, 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 r259-tall-174931345100121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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