fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r299-tall-167873953200581
Last Updated
May 14, 2023

About the Execution of Smart+red for PolyORBLF-PT-S04J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
576.707 109339.00 122707.00 385.20 4 1 9 1 1 1 10 4 1 2 1 4 1 1 1 1 normal

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.r299-tall-167873953200581.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 PolyORBLF-PT-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953200581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 26K Feb 26 14:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 14:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Feb 26 14:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 480K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 26 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 248K Feb 26 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Feb 26 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Feb 26 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.6K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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
-rw-r--r-- 1 mcc users 4.3M 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 PolyORBLF-PT-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679514523940

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=PolyORBLF-PT-S04J06T10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 19:48:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 19:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:48:45] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2023-03-22 19:48:45] [INFO ] Transformed 966 places.
[2023-03-22 19:48:45] [INFO ] Transformed 5354 transitions.
[2023-03-22 19:48:45] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Normalized transition count is 2604 out of 2644 initially.
// Phase 1: matrix 2604 rows 966 cols
[2023-03-22 19:48:46] [INFO ] Computed 62 place invariants in 177 ms
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) 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 14) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :40
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :33
[2023-03-22 19:48:46] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2023-03-22 19:48:46] [INFO ] Computed 62 place invariants in 96 ms
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 31 ms returned unsat
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 32 ms returned unsat
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:47] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 45 ms returned sat
[2023-03-22 19:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using state equation in 4846 ms returned unknown
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 34 ms returned unsat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 32 ms returned unsat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned unsat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 33 ms returned unsat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-22 19:48:52] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 18 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 12 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 35 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 29 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 46 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 13 ms returned unsat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 19:48:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 100, 1, 1, 1, 10, 4, 2, 1, 4, 1, 1, 1] Max seen :[4, 1, 9, 1, 1, 1, 10, 4, 2, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 604 place count 662 transition count 2344
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 624 place count 662 transition count 2324
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 644 place count 642 transition count 2324
Applied a total of 644 rules in 398 ms. Remains 642 /966 variables (removed 324) and now considering 2324/2644 (removed 320) transitions.
[2023-03-22 19:48:54] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 642 cols
[2023-03-22 19:48:54] [INFO ] Computed 58 place invariants in 50 ms
[2023-03-22 19:48:56] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 642/966 places, 1784/2644 transitions.
Applied a total of 0 rules in 52 ms. Remains 642 /642 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2250 ms. Remains : 642/966 places, 1784/2644 transitions.
Normalized transition count is 1744 out of 1784 initially.
// Phase 1: matrix 1744 rows 642 cols
[2023-03-22 19:48:56] [INFO ] Computed 58 place invariants in 41 ms
Incomplete random walk after 1000000 steps, including 93 resets, run finished after 7211 ms. (steps per millisecond=138 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2477 ms. (steps per millisecond=403 ) properties (out of 1) seen :9
[2023-03-22 19:49:05] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 642 cols
[2023-03-22 19:49:05] [INFO ] Computed 58 place invariants in 31 ms
[2023-03-22 19:49:05] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 19:49:05] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-22 19:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:49:50] [INFO ] [Real]Absence check using state equation in 44907 ms returned unknown
Current structural bounds on expressions (after SMT) : [100] Max seen :[9]
Support contains 10 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1784/1784 transitions.
Applied a total of 0 rules in 39 ms. Remains 642 /642 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 642/642 places, 1784/1784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1784/1784 transitions.
Applied a total of 0 rules in 39 ms. Remains 642 /642 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
[2023-03-22 19:49:50] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-22 19:49:50] [INFO ] Invariant cache hit.
[2023-03-22 19:49:51] [INFO ] Implicit Places using invariants in 760 ms returned [67, 148, 183, 227, 309, 346, 368, 441, 479, 560]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 766 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 632/642 places, 1784/1784 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 626 transition count 1778
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 626 transition count 1778
Applied a total of 12 rules in 52 ms. Remains 626 /632 variables (removed 6) and now considering 1778/1784 (removed 6) transitions.
[2023-03-22 19:49:51] [INFO ] Flow matrix only has 1738 transitions (discarded 40 similar events)
// Phase 1: matrix 1738 rows 626 cols
[2023-03-22 19:49:51] [INFO ] Computed 48 place invariants in 32 ms
[2023-03-22 19:49:52] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-22 19:49:52] [INFO ] Flow matrix only has 1738 transitions (discarded 40 similar events)
[2023-03-22 19:49:52] [INFO ] Invariant cache hit.
[2023-03-22 19:49:53] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 19:50:17] [INFO ] Implicit Places using invariants and state equation in 24550 ms returned []
Implicit Place search using SMT with State Equation took 25498 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 626/642 places, 1778/1784 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26355 ms. Remains : 626/642 places, 1778/1784 transitions.
Normalized transition count is 1738 out of 1778 initially.
// Phase 1: matrix 1738 rows 626 cols
[2023-03-22 19:50:17] [INFO ] Computed 48 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 88 resets, run finished after 6670 ms. (steps per millisecond=149 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2287 ms. (steps per millisecond=437 ) properties (out of 1) seen :9
[2023-03-22 19:50:26] [INFO ] Flow matrix only has 1738 transitions (discarded 40 similar events)
// Phase 1: matrix 1738 rows 626 cols
[2023-03-22 19:50:26] [INFO ] Computed 48 place invariants in 33 ms
[2023-03-22 19:50:26] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-22 19:50:26] [INFO ] [Real]Absence check using 23 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-22 19:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:50:27] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2023-03-22 19:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:50:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-22 19:50:27] [INFO ] [Nat]Absence check using 23 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-22 19:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:50:31] [INFO ] [Nat]Absence check using state equation in 3437 ms returned sat
[2023-03-22 19:50:31] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 19:50:32] [INFO ] [Nat]Added 200 Read/Feed constraints in 634 ms returned sat
[2023-03-22 19:50:32] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 6 ms to minimize.
[2023-03-22 19:50:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 381 ms
Current structural bounds on expressions (after SMT) : [9] Max seen :[9]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 107056 ms.
ITS solved all properties within timeout

BK_STOP 1679514633279

--------------------
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="PolyORBLF-PT-S04J06T10"
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 PolyORBLF-PT-S04J06T10, 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 r299-tall-167873953200581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;