fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r049-tall-174854035500041
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CloudDeployment-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 84046.00 0.00 0.00 T normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K 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 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 317K 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 1748586272749

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-05-30 06:24:34] [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-05-30 06:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:24:34] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-30 06:24:34] [INFO ] Transformed 221 places.
[2025-05-30 06:24:34] [INFO ] Transformed 908 transitions.
[2025-05-30 06:24:34] [INFO ] Found NUPN structural information;
[2025-05-30 06:24:34] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 214 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.17388KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 221/221 places, 794/794 transitions.
Graph (trivial) has 241 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Computed a total of 125 stabilizing places and 479 stable transitions
Graph (complete) has 2101 edges and 179 vertex of which 166 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.9 ms
Discarding 13 places :
Also discarding 0 output transitions
Computed a total of 112 stabilizing places and 478 stable transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 156 transition count 616
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 156 transition count 616
Computed a total of 102 stabilizing places and 432 stable transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 153 transition count 613
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 153 transition count 613
Computed a total of 99 stabilizing places and 429 stable transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 151 transition count 611
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 151 transition count 611
Computed a total of 97 stabilizing places and 427 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 150 transition count 610
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 150 transition count 610
Computed a total of 96 stabilizing places and 426 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
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 70 place count 132 transition count 676
Computed a total of 78 stabilizing places and 492 stable transitions
Computed a total of 78 stabilizing places and 492 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 177 transitions
Redundant transition composition rules discarded 177 transitions
Iterating global reduction 0 with 177 rules applied. Total rules applied 247 place count 132 transition count 499
Computed a total of 78 stabilizing places and 390 stable transitions
Computed a total of 78 stabilizing places and 390 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 248 place count 131 transition count 498
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Applied a total of 248 rules in 227 ms. Remains 131 /221 variables (removed 90) and now considering 498/794 (removed 296) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 238 ms. Remains : 131/221 places, 498/794 transitions.
Random walk for 1250000 steps, including 20640 resets, run took 3209 ms (no deadlock found). (steps per millisecond=389 )
Random directed walk for 1250006 steps, including 5401 resets, run took 2862 ms (no deadlock found). (steps per millisecond=436 )
[2025-05-30 06:24:40] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
// Phase 1: matrix 199 rows 131 cols
[2025-05-30 06:24:40] [INFO ] Computed 23 invariants in 9 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-30 06:24:40] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 9 ms returned sat
[2025-05-30 06:24:40] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-05-30 06:24:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-30 06:24:41] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 9 ms returned sat
[2025-05-30 06:24:41] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-30 06:24:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 06:24:41] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2025-05-30 06:24:41] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 20 ms.
[2025-05-30 06:24:41] [INFO ] Added : 104 causal constraints over 24 iterations in 709 ms. Result :sat
Parikh directed walk for 10200 steps, including 152 resets, run took 44 ms. (steps per millisecond=231 )
Random directed walk for 500000 steps, including 2159 resets, run took 1280 ms (no deadlock found). (steps per millisecond=390 )
Random walk for 500000 steps, including 8251 resets, run took 1204 ms (no deadlock found). (steps per millisecond=415 )
Random directed walk for 500003 steps, including 2163 resets, run took 1251 ms (no deadlock found). (steps per millisecond=399 )
Random walk for 500000 steps, including 8298 resets, run took 1186 ms (no deadlock found). (steps per millisecond=421 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 131/131 places, 498/498 transitions.
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Computed a total of 77 stabilizing places and 390 stable transitions
Applied a total of 0 rules in 17 ms. Remains 131 /131 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2025-05-30 06:24:46] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2025-05-30 06:24:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:47] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-05-30 06:24:47] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2025-05-30 06:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:24:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 06:24:47] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:24:47] [INFO ] Redundant transitions in 398 ms returned []
Running 455 sub problems to find dead transitions.
[2025-05-30 06:24:47] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2025-05-30 06:24:47] [INFO ] Invariant cache hit.
[2025-05-30 06:24:47] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/154 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/330 variables, and 161 constraints, problems are : Problem set: 0 solved, 455 unsolved in 25742 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 131/131 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 6/131 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (OVERLAPS) 198/329 variables, 131/154 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 455/616 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/330 variables, and 616 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 131/131 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56259ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 56270ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 57141 ms. Remains : 131/131 places, 498/498 transitions.
Random walk for 1250000 steps, including 20641 resets, run took 2892 ms (no deadlock found). (steps per millisecond=432 )
Random directed walk for 1250001 steps, including 5392 resets, run took 2961 ms (no deadlock found). (steps per millisecond=422 )
[2025-05-30 06:25:49] [INFO ] Flow matrix only has 199 transitions (discarded 299 similar events)
[2025-05-30 06:25:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-30 06:25:49] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 6 ms returned sat
[2025-05-30 06:25:50] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-30 06:25:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-05-30 06:25:50] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 17 ms returned sat
[2025-05-30 06:25:50] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-30 06:25:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 06:25:50] [INFO ] [Nat]Added 7 Read/Feed constraints in 12 ms returned sat
[2025-05-30 06:25:50] [INFO ] Computed and/alt/rep : 146/270/146 causal constraints (skipped 15 transitions) in 15 ms.
[2025-05-30 06:25:50] [INFO ] Added : 88 causal constraints over 18 iterations in 451 ms. Result :sat
Parikh directed walk for 8600 steps, including 141 resets, run took 30 ms. (steps per millisecond=286 )
Random directed walk for 500002 steps, including 2149 resets, run took 1215 ms (no deadlock found). (steps per millisecond=411 )
Random walk for 500000 steps, including 8244 resets, run took 1194 ms (no deadlock found). (steps per millisecond=418 )
Random directed walk for 500007 steps, including 2147 resets, run took 1215 ms (no deadlock found). (steps per millisecond=411 )
Random walk for 500000 steps, including 8272 resets, run took 1161 ms (no deadlock found). (steps per millisecond=430 )
[2025-05-30 06:25:55] [INFO ] Flatten gal took : 99 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15024842389961529222
[2025-05-30 06:25:55] [INFO ] Computing symmetric may disable matrix : 794 transitions.
[2025-05-30 06:25:55] [INFO ] Applying decomposition
[2025-05-30 06:25:55] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:25:55] [INFO ] Flatten gal took : 62 ms
[2025-05-30 06:25:55] [INFO ] Computing symmetric may enable matrix : 794 transitions.
[2025-05-30 06:25:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10543999337551368341.txt' '-o' '/tmp/graph10543999337551368341.bin' '-w' '/tmp/graph10543999337551368341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10543999337551368341.bin' '-l' '-1' '-v' '-w' '/tmp/graph10543999337551368341.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:25:56] [INFO ] Decomposing Gal with order
[2025-05-30 06:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:25:56] [INFO ] Computing Do-Not-Accords matrix : 794 transitions.
[2025-05-30 06:25:56] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:25:56] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15024842389961529222
Running compilation step : cd /tmp/ltsmin15024842389961529222;'/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'
[2025-05-30 06:25:56] [INFO ] Removed a total of 892 redundant transitions.
[2025-05-30 06:25:56] [INFO ] Flatten gal took : 197 ms
[2025-05-30 06:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 24 ms.
[2025-05-30 06:25:56] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock15198474861593266961.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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock15198474861593266961.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.
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,8.3047e+09,0.188404,10812,303,122,13143,1173,908,21033,304,3426,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,2,0.219523,10812,79,70,13143,1173,2473,21033,1421,3426,5474

System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ u50={[ ]
} u47={[ ]
} i11={[ u61={[ ]
} u53={[ ]
} ]
} i10={[ u52={[ ]
} u51={[ ]
} ]
} i9={[ u49={[ ]
} u48={[ ]
} ]
} i7={[ u54={[ p87=1 p113=1 p85=1 p1=1 p59=1 p115=1 p57=1 p141=1 p31=1 p169=1 p29=1 p3=1 p143=1 ]
} u46={[ ]
} u45={[ ]
} ]
} i6={[ i1={[ u56={[ ]
} u44={[ p168=1 ]
} u43={[ ]
} u42={[ ]
} ]
} i0={[ u41={[ ]
} u40={[ ]
} u38={[ ]
} u39={[ ]
} ]
} ]
} i5={[ i1={[ u37={[ p140=1 ]
} u36={[ ]
} u35={[ ]
} ]
} i0={[ u34={[ ]
} u33={[ ]
} u31={[ ]
} u32={[ ]
} ]
} ]
} i4={[ i1={[ u28={[ ]
} u27={[ ]
} u26={[ ]
} u24={[ ]
} u25={[ ]
} ]
} i0={[ u59={[ ]
} u30={[ p112=1 ]
} u29={[ ]
} u23={[ ]
} ]
} ]
} i3={[ i1={[ u22={[ p84=1 ]
} u21={[ ]
} u20={[ ]
} u19={[ ]
} ]
} i0={[ u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} ]
} i2={[ i1={[ u60={[ ]
} u57={[ ]
} u55={[ ]
} u14={[ p56=1 ]
} u13={[ ]
} ]
} i0={[ u12={[ ]
} u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} ]
} i0={[ i1={[ u58={[ ]
} u7={[ p28=1 ]
} u6={[ ]
} u5={[ ]
} ]
} i0={[ u4={[ ]
} u3={[ ]
} u2={[ ]
} u0={[ ]
} u1={[ ]
} ]
} ]
} ]
[ u50={[ ]
} u47={[ ]
} i11={[ u61={[ ]
} u53={[ ]
} ]
} i10={[ u52={[ ]
} u51={[ ]
} ]
} i9={[ u49={[ ]
} u48={[ ]
} ]
} i7={[ u54={[ ]
} u46={[ ]
} u45={[ ]
} ]
} i6={[ i1={[ u56={[ ]
} u44={[ ]
} u43={[ ]
} u42={[ ]
} ]
} i0={[ u41={[ ]
} u40={[ ]
} u38={[ ]
} u39={[ ]
} ]
} ]
} i5={[ i1={[ u37={[ ]
} u36={[ ]
} u35={[ ]
} ]
} i0={[ u34={[ ]
} u33={[ ]
} u31={[ ]
} u32={[ ]
} ]
} ]
} i4={[ i1={[ u28={[ ]
} u27={[ ]
} u26={[ ]
} u24={[ ]
} u25={[ ]
} ]
} i0={[ u59={[ ]
} u30={[ ]
} u29={[ ]
} u23={[ ]
} ]
} ]
} i3={[ i1={[ u22={[ ]
} u21={[ ]
} u20={[ ]
} u19={[ ]
} ]
} i0={[ u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} ]
} i2={[ i1={[ u60={[ ]
} u57={[ ]
} u55={[ ]
} u14={[ ]
} u13={[ ]
} ]
} i0={[ u12={[ ]
} u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} ]
} i0={[ i1={[ u58={[ ]
} u7={[ ]
} u6={[ ]
} u5={[ ]
} ]
} i0={[ u4={[ ]
} u3={[ ]
} u2={[ ]
} u0={[ ]
} u1={[ ]
} ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 82709 ms.

BK_STOP 1748586356795

--------------------
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="CloudDeployment-PT-6a"
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 CloudDeployment-PT-6a, 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 r049-tall-174854035500041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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