Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r079-tall-171620516400386.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CloudDeployment-PT-7a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-171620516400386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 420K May 18 16:42 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 1716215426097

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-7a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-20 14:30:27] [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]
[2024-05-20 14:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:30:27] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-20 14:30:27] [INFO ] Transformed 264 places.
[2024-05-20 14:30:27] [INFO ] Transformed 1174 transitions.
[2024-05-20 14:30:27] [INFO ] Found NUPN structural information;
[2024-05-20 14:30:27] [INFO ] Parsed PT model containing 264 places and 1174 transitions and 7331 arcs in 231 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.18162KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 264/264 places, 1020/1020 transitions.
Graph (trivial) has 281 edges and 264 vertex of which 70 / 264 are part of one of the 21 SCC in 4 ms
Free SCC test removed 49 places
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Computed a total of 152 stabilizing places and 635 stable transitions
Graph (complete) has 2709 edges and 215 vertex of which 200 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.12 ms
Discarding 15 places :
Also discarding 0 output transitions
Computed a total of 137 stabilizing places and 634 stable transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 14 place count 188 transition count 798
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 188 transition count 798
Computed a total of 125 stabilizing places and 573 stable transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 184 transition count 794
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 184 transition count 794
Computed a total of 121 stabilizing places and 569 stable transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 181 transition count 791
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 181 transition count 791
Computed a total of 118 stabilizing places and 566 stable transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 179 transition count 789
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 179 transition count 789
Computed a total of 116 stabilizing places and 564 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 178 transition count 788
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 178 transition count 788
Computed a total of 115 stabilizing places and 563 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 88 place count 157 transition count 879
Computed a total of 94 stabilizing places and 654 stable transitions
Computed a total of 94 stabilizing places and 654 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 231 transitions
Redundant transition composition rules discarded 231 transitions
Iterating global reduction 0 with 231 rules applied. Total rules applied 319 place count 157 transition count 648
Computed a total of 94 stabilizing places and 521 stable transitions
Computed a total of 94 stabilizing places and 521 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 320 place count 156 transition count 647
Computed a total of 93 stabilizing places and 521 stable transitions
Computed a total of 93 stabilizing places and 521 stable transitions
Applied a total of 320 rules in 257 ms. Remains 156 /264 variables (removed 108) and now considering 647/1020 (removed 373) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 269 ms. Remains : 156/264 places, 647/1020 transitions.
Random walk for 1250000 steps, including 17930 resets, run took 3146 ms (no deadlock found). (steps per millisecond=397 )
Random directed walk for 1250000 steps, including 4006 resets, run took 3236 ms (no deadlock found). (steps per millisecond=386 )
[2024-05-20 14:30:34] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2024-05-20 14:30:34] [INFO ] Computed 27 invariants in 18 ms
[2024-05-20 14:30:34] [INFO ] [Real]Absence check using 0 positive and 27 generalized place invariants in 7 ms returned sat
[2024-05-20 14:30:34] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-20 14:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:30:34] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-20 14:30:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-20 14:30:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-20 14:30:34] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-05-20 14:30:34] [INFO ] Computed and/alt/rep : 181/340/181 causal constraints (skipped 17 transitions) in 59 ms.
[2024-05-20 14:30:35] [INFO ] Added : 79 causal constraints over 16 iterations in 486 ms. Result :sat
Parikh directed walk for 8800 steps, including 129 resets, run took 38 ms. (steps per millisecond=231 )
Random directed walk for 500021 steps, including 1617 resets, run took 1274 ms (no deadlock found). (steps per millisecond=392 )
Random walk for 500000 steps, including 7141 resets, run took 1148 ms (no deadlock found). (steps per millisecond=435 )
Random directed walk for 500000 steps, including 1605 resets, run took 1284 ms (no deadlock found). (steps per millisecond=389 )
Random walk for 500000 steps, including 7121 resets, run took 1138 ms (no deadlock found). (steps per millisecond=439 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 156/156 places, 647/647 transitions.
Computed a total of 93 stabilizing places and 521 stable transitions
Computed a total of 93 stabilizing places and 521 stable transitions
Computed a total of 93 stabilizing places and 521 stable transitions
Applied a total of 0 rules in 23 ms. Remains 156 /156 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2024-05-20 14:30:40] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2024-05-20 14:30:40] [INFO ] Invariant cache hit.
[2024-05-20 14:30:40] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-20 14:30:40] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2024-05-20 14:30:40] [INFO ] Invariant cache hit.
[2024-05-20 14:30:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-20 14:30:40] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-20 14:30:41] [INFO ] Redundant transitions in 426 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-20 14:30:41] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2024-05-20 14:30:41] [INFO ] Invariant cache hit.
[2024-05-20 14:30:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (OVERLAPS) 7/156 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (OVERLAPS) 248/404 variables, 156/183 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 590 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/405 variables, and 191 constraints, problems are : Problem set: 0 solved, 590 unsolved in 20226 ms.
Refiners :[Generalized P Invariants (flows): 27/27 constraints, State Equation: 156/156 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (OVERLAPS) 7/156 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (OVERLAPS) 248/404 variables, 156/183 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 590/781 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 590 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/405 variables, and 781 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 27/27 constraints, State Equation: 156/156 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 0/0 constraints]
After SMT, in 51236ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 51266ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 52073 ms. Remains : 156/156 places, 647/647 transitions.
Random walk for 1250000 steps, including 17892 resets, run took 2913 ms (no deadlock found). (steps per millisecond=429 )
Random directed walk for 1250003 steps, including 4017 resets, run took 3317 ms (no deadlock found). (steps per millisecond=376 )
[2024-05-20 14:31:38] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
[2024-05-20 14:31:38] [INFO ] Invariant cache hit.
[2024-05-20 14:31:38] [INFO ] [Real]Absence check using 0 positive and 27 generalized place invariants in 10 ms returned sat
[2024-05-20 14:31:38] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 14:31:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:31:38] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 6 ms returned sat
[2024-05-20 14:31:38] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-20 14:31:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-20 14:31:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-20 14:31:38] [INFO ] Computed and/alt/rep : 181/340/181 causal constraints (skipped 17 transitions) in 30 ms.
[2024-05-20 14:31:39] [INFO ] Added : 129 causal constraints over 26 iterations in 626 ms. Result :sat
Parikh directed walk for 11200 steps, including 141 resets, run took 34 ms. (steps per millisecond=329 )
Random directed walk for 500013 steps, including 1599 resets, run took 1426 ms (no deadlock found). (steps per millisecond=350 )
Random walk for 500000 steps, including 7174 resets, run took 1147 ms (no deadlock found). (steps per millisecond=435 )
Random directed walk for 500008 steps, including 1606 resets, run took 1275 ms (no deadlock found). (steps per millisecond=392 )
Random walk for 500000 steps, including 7166 resets, run took 1128 ms (no deadlock found). (steps per millisecond=443 )
[2024-05-20 14:31:44] [INFO ] Flatten gal took : 212 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9306147899209163778
[2024-05-20 14:31:45] [INFO ] Computing symmetric may disable matrix : 1020 transitions.
[2024-05-20 14:31:45] [INFO ] Applying decomposition
[2024-05-20 14:31:45] [INFO ] Computation of Complete disable matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:31:45] [INFO ] Flatten gal took : 146 ms
[2024-05-20 14:31:45] [INFO ] Computing symmetric may enable matrix : 1020 transitions.
[2024-05-20 14:31:45] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:31:45] [INFO ] Computing Do-Not-Accords matrix : 1020 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17855259941998940714.txt' '-o' '/tmp/graph17855259941998940714.bin' '-w' '/tmp/graph17855259941998940714.weights'
[2024-05-20 14:31:45] [INFO ] Computation of Completed DNA matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17855259941998940714.bin' '-l' '-1' '-v' '-w' '/tmp/graph17855259941998940714.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:31:46] [INFO ] Built C files in 831ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9306147899209163778
Running compilation step : cd /tmp/ltsmin9306147899209163778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 14:31:46] [INFO ] Decomposing Gal with order
[2024-05-20 14:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:31:46] [INFO ] Removed a total of 1195 redundant transitions.
[2024-05-20 14:31:47] [INFO ] Flatten gal took : 998 ms
[2024-05-20 14:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 87 ms.
[2024-05-20 14:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock7923483332825273836.gal : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock7923483332825273836.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.202405141337/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,2.6648e+11,0.25312,11092,213,153,14434,1584,825,18892,367,5294,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.285641,11092,59,82,14434,1584,2474,18892,1777,5294,4654

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

BK_STOP 1716215508334

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-7a"
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-5568"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-7a, 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 r079-tall-171620516400386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7a.tgz
mv CloudDeployment-PT-7a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;