About the Execution of Smart+red for NeighborGrid-PT-d4n3m2c23
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r267-smll-167863541400101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541400101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 8.3K Feb 26 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 26 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 469K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678759483355
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d4n3m2c23
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 02:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 02:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:04:47] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-14 02:04:47] [INFO ] Transformed 81 places.
[2023-03-14 02:04:47] [INFO ] Transformed 1632 transitions.
[2023-03-14 02:04:47] [INFO ] Parsed PT model containing 81 places and 1632 transitions and 3264 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1632 rows 81 cols
[2023-03-14 02:04:47] [INFO ] Computed 1 place invariants in 50 ms
Incomplete random walk after 10037 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=79 ) properties (out of 16) seen :665
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :35
[2023-03-14 02:04:47] [INFO ] Invariant cache hit.
[2023-03-14 02:04:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-14 02:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:48] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-14 02:04:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 139 ms.
[2023-03-14 02:04:49] [INFO ] Added : 0 causal constraints over 0 iterations in 364 ms. Result :sat
Minimization took 125 ms.
[2023-03-14 02:04:49] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:50] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-14 02:04:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 153 ms.
[2023-03-14 02:04:50] [INFO ] Added : 0 causal constraints over 0 iterations in 308 ms. Result :sat
Minimization took 194 ms.
[2023-03-14 02:04:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:51] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-14 02:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:51] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-14 02:04:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 99 ms.
[2023-03-14 02:04:51] [INFO ] Added : 0 causal constraints over 0 iterations in 214 ms. Result :sat
Minimization took 91 ms.
[2023-03-14 02:04:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:52] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-14 02:04:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-14 02:04:52] [INFO ] Added : 0 causal constraints over 0 iterations in 261 ms. Result :sat
Minimization took 112 ms.
[2023-03-14 02:04:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:53] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-14 02:04:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 88 ms.
[2023-03-14 02:04:53] [INFO ] Added : 0 causal constraints over 0 iterations in 205 ms. Result :sat
Minimization took 118 ms.
[2023-03-14 02:04:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:54] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-14 02:04:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:54] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-14 02:04:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 121 ms.
[2023-03-14 02:04:54] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Minimization took 91 ms.
[2023-03-14 02:04:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:55] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-14 02:04:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:55] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-14 02:04:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 94 ms.
[2023-03-14 02:04:56] [INFO ] Added : 0 causal constraints over 0 iterations in 196 ms. Result :sat
Minimization took 91 ms.
[2023-03-14 02:04:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:56] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-14 02:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 02:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:56] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-14 02:04:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 93 ms.
[2023-03-14 02:04:57] [INFO ] Added : 0 causal constraints over 0 iterations in 194 ms. Result :sat
Minimization took 93 ms.
[2023-03-14 02:04:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:57] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-14 02:04:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 131 ms.
[2023-03-14 02:04:58] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 183 ms.
[2023-03-14 02:04:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:58] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-14 02:04:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:59] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-14 02:04:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 118 ms.
[2023-03-14 02:04:59] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Minimization took 91 ms.
[2023-03-14 02:04:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:00] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-14 02:05:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 125 ms.
[2023-03-14 02:05:00] [INFO ] Added : 0 causal constraints over 0 iterations in 284 ms. Result :sat
Minimization took 180 ms.
[2023-03-14 02:05:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:01] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2023-03-14 02:05:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-14 02:05:01] [INFO ] Added : 0 causal constraints over 0 iterations in 260 ms. Result :sat
Minimization took 113 ms.
[2023-03-14 02:05:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:02] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-14 02:05:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-14 02:05:02] [INFO ] Added : 0 causal constraints over 0 iterations in 212 ms. Result :sat
Minimization took 111 ms.
[2023-03-14 02:05:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:03] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-14 02:05:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 118 ms.
[2023-03-14 02:05:03] [INFO ] Added : 0 causal constraints over 0 iterations in 257 ms. Result :sat
Minimization took 114 ms.
[2023-03-14 02:05:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:04] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-14 02:05:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:05:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 02:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:04] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-14 02:05:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 118 ms.
[2023-03-14 02:05:04] [INFO ] Added : 0 causal constraints over 0 iterations in 256 ms. Result :sat
Minimization took 127 ms.
[2023-03-14 02:05:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-14 02:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:05] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-14 02:05:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 85 ms.
[2023-03-14 02:05:05] [INFO ] Added : 0 causal constraints over 0 iterations in 225 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162] Max seen :[12, 96, 6, 8, 96, 12, 31, 31, 5, 14, 62, 58, 24, 62, 93, 56]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-09 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-08 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-07 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-06 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-05 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-04 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-03 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-02 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-01 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-00 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 28191 ms.
ITS solved all properties within timeout
BK_STOP 1678759515865
--------------------
content from stderr:
+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5348"
echo " Executing tool smartxred"
echo " Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;