Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r053-smll-165252138900051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r053-smll-165252138900051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Apr 30 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 30 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 11:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 420K May 10 09:33 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 1652592234937

Running Version 202205111006
[2022-05-15 05:23:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-15 05:23:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:23:57] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2022-05-15 05:23:57] [INFO ] Transformed 264 places.
[2022-05-15 05:23:57] [INFO ] Transformed 1174 transitions.
[2022-05-15 05:23:57] [INFO ] Found NUPN structural information;
[2022-05-15 05:23:57] [INFO ] Parsed PT model containing 264 places and 1174 transitions in 585 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 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 11 ms.10120KB memory used
Starting structural reductions in DEADLOCKS 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 8 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.28 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 3 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 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 520 stable transitions
Computed a total of 93 stabilizing places and 520 stable transitions
Applied a total of 320 rules in 360 ms. Remains 156 /264 variables (removed 108) and now considering 647/1020 (removed 373) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/264 places, 647/1020 transitions.
Random walk for 1250000 steps, including 17901 resets, run took 3834 ms (no deadlock found). (steps per millisecond=326 )
Random directed walk for 1250005 steps, including 4011 resets, run took 4635 ms (no deadlock found). (steps per millisecond=269 )
[2022-05-15 05:24:06] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2022-05-15 05:24:06] [INFO ] Computed 27 place invariants in 15 ms
[2022-05-15 05:24:06] [INFO ] [Real]Absence check using 0 positive and 27 generalized place invariants in 19 ms returned sat
[2022-05-15 05:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:06] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-05-15 05:24:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:24:07] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-15 05:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:07] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2022-05-15 05:24:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 05:24:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
[2022-05-15 05:24:07] [INFO ] Computed and/alt/rep : 181/340/181 causal constraints (skipped 17 transitions) in 59 ms.
[2022-05-15 05:24:08] [INFO ] Added : 81 causal constraints over 17 iterations in 617 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Parikh directed walk for 9200 steps, including 146 resets, run took 42 ms. (steps per millisecond=219 )
Random directed walk for 500007 steps, including 1607 resets, run took 1698 ms (no deadlock found). (steps per millisecond=294 )
Random walk for 500000 steps, including 7141 resets, run took 1454 ms (no deadlock found). (steps per millisecond=343 )
Random directed walk for 500001 steps, including 1604 resets, run took 1729 ms (no deadlock found). (steps per millisecond=289 )
Random walk for 500000 steps, including 7169 resets, run took 1444 ms (no deadlock found). (steps per millisecond=346 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 156/156 places, 647/647 transitions.
Computed a total of 93 stabilizing places and 520 stable transitions
Computed a total of 93 stabilizing places and 520 stable transitions
Computed a total of 93 stabilizing places and 520 stable transitions
Applied a total of 0 rules in 26 ms. Remains 156 /156 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2022-05-15 05:24:14] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2022-05-15 05:24:14] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-15 05:24:14] [INFO ] Implicit Places using invariants in 201 ms returned []
[2022-05-15 05:24:14] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2022-05-15 05:24:14] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-15 05:24:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 05:24:15] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2022-05-15 05:24:15] [INFO ] Redundant transitions in 702 ms returned []
[2022-05-15 05:24:15] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2022-05-15 05:24:15] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-15 05:24:16] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 647/647 transitions.
Random walk for 1250000 steps, including 17911 resets, run took 3617 ms (no deadlock found). (steps per millisecond=345 )
Random directed walk for 1250018 steps, including 4015 resets, run took 4282 ms (no deadlock found). (steps per millisecond=291 )
[2022-05-15 05:24:24] [INFO ] Flow matrix only has 249 transitions (discarded 398 similar events)
// Phase 1: matrix 249 rows 156 cols
[2022-05-15 05:24:24] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-15 05:24:24] [INFO ] [Real]Absence check using 0 positive and 27 generalized place invariants in 12 ms returned sat
[2022-05-15 05:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:24] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-15 05:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:24:24] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 12 ms returned sat
[2022-05-15 05:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:24:24] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-15 05:24:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 05:24:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2022-05-15 05:24:24] [INFO ] Computed and/alt/rep : 181/340/181 causal constraints (skipped 17 transitions) in 47 ms.
[2022-05-15 05:24:25] [INFO ] Added : 81 causal constraints over 17 iterations in 464 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Parikh directed walk for 9200 steps, including 147 resets, run took 60 ms. (steps per millisecond=153 )
Random directed walk for 500005 steps, including 1600 resets, run took 2002 ms (no deadlock found). (steps per millisecond=249 )
Random walk for 500000 steps, including 7156 resets, run took 1444 ms (no deadlock found). (steps per millisecond=346 )
Random directed walk for 500002 steps, including 1606 resets, run took 1730 ms (no deadlock found). (steps per millisecond=289 )
Random walk for 500000 steps, including 7129 resets, run took 1443 ms (no deadlock found). (steps per millisecond=346 )
[2022-05-15 05:24:32] [INFO ] Flatten gal took : 205 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7119819622024738270
[2022-05-15 05:24:32] [INFO ] Computing symmetric may disable matrix : 1020 transitions.
[2022-05-15 05:24:32] [INFO ] Applying decomposition
[2022-05-15 05:24:32] [INFO ] Computation of Complete disable matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 05:24:32] [INFO ] Flatten gal took : 112 ms
[2022-05-15 05:24:32] [INFO ] Computing symmetric may enable matrix : 1020 transitions.
[2022-05-15 05:24:32] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18122339635013963287.txt' '-o' '/tmp/graph18122339635013963287.bin' '-w' '/tmp/graph18122339635013963287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18122339635013963287.bin' '-l' '-1' '-v' '-w' '/tmp/graph18122339635013963287.weights' '-q' '0' '-e' '0.001'
[2022-05-15 05:24:32] [INFO ] Decomposing Gal with order
[2022-05-15 05:24:33] [INFO ] Computing Do-Not-Accords matrix : 1020 transitions.
[2022-05-15 05:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 05:24:33] [INFO ] Computation of Completed DNA matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 05:24:33] [INFO ] Built C files in 699ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7119819622024738270
Running compilation step : cd /tmp/ltsmin7119819622024738270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 05:24:33] [INFO ] Removed a total of 1188 redundant transitions.
[2022-05-15 05:24:33] [INFO ] Flatten gal took : 555 ms
[2022-05-15 05:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 85 ms.
[2022-05-15 05:24:34] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock9710548947953321321.gal : 41 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock9710548947953321321.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
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.313247,12060,272,173,13671,1513,854,19852,379,5458,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.374791,12444,62,84,13671,1513,2502,19852,1829,5458,6482

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

BK_STOP 1652592274540

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r053-smll-165252138900051"
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 ;