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.r157-smll-165277001700164.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 ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-165277001700164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 8.6K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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 Liveness

=== Now, execution of the tool begins

BK_START 1652865333033

Running Version 202205111006
[2022-05-18 09:15:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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-18 09:15:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:15:35] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2022-05-18 09:15:35] [INFO ] Transformed 231 places.
[2022-05-18 09:15:35] [INFO ] Transformed 202 transitions.
[2022-05-18 09:15:35] [INFO ] Found NUPN structural information;
[2022-05-18 09:15:35] [INFO ] Parsed PT model containing 231 places and 202 transitions in 361 ms.
Built sparse matrix representations for Structural reductions in 8 ms.13457KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 32 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 20 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:15:35] [INFO ] Computed 59 place invariants in 31 ms
[2022-05-18 09:15:35] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:15:35] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-18 09:15:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:15:36] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2022-05-18 09:15:36] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:15:36] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-18 09:15:36] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1907 ms (no deadlock found). (steps per millisecond=655 )
Random directed walk for 1250002 steps, including 0 resets, run took 1634 ms (no deadlock found). (steps per millisecond=764 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-18 09:15:40] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-18 09:15:40] [INFO ] [Real]Absence check using 35 positive place invariants in 51 ms returned sat
[2022-05-18 09:15:40] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 149 ms returned sat
[2022-05-18 09:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:15:41] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2022-05-18 09:15:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:15:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2022-05-18 09:15:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 52 ms returned sat
[2022-05-18 09:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:15:44] [INFO ] [Nat]Absence check using state equation in 2160 ms returned sat
[2022-05-18 09:15:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-18 09:15:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 65 ms returned sat
[2022-05-18 09:15:44] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 7 ms to minimize.
[2022-05-18 09:15:44] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2022-05-18 09:15:44] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 3 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2022-05-18 09:15:45] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 1 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2022-05-18 09:15:46] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2022-05-18 09:15:47] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 0 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2022-05-18 09:15:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 4252 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 69 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2022-05-18 09:15:48] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-18 09:15:49] [INFO ] Implicit Places using invariants in 301 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 92, 93, 95, 97, 98, 119, 132, 133, 135, 137, 138, 160, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 306 ms to find 46 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 147/231 places, 164/202 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 147 transition count 137
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 120 transition count 137
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 54 place count 120 transition count 130
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 113 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 111 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 111 transition count 128
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 152 place count 71 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 70 transition count 87
Applied a total of 154 rules in 36 ms. Remains 70 /147 variables (removed 77) and now considering 87/164 (removed 77) transitions.
// Phase 1: matrix 87 rows 70 cols
[2022-05-18 09:15:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-18 09:15:49] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 87 rows 70 cols
[2022-05-18 09:15:49] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-18 09:15:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-18 09:15:49] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 70/231 places, 87/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/231 places, 87/202 transitions.
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 86) seen :62
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 87 rows 70 cols
[2022-05-18 09:15:51] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-18 09:15:51] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-18 09:15:51] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-18 09:15:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 09:15:51] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-18 09:15:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-18 09:15:52] [INFO ] After 151ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 166 ms
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 186 ms
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 64 ms
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2022-05-18 09:15:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 65 ms
[2022-05-18 09:15:52] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :0
[2022-05-18 09:15:52] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 17832 ms.

BK_STOP 1652865352763

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 Liveness -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="ParamProductionCell-PT-1"
export BK_EXAMINATION="Liveness"
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 ParamProductionCell-PT-1, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-165277001700164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;