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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 20K Feb 26 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 583K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K 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 3.5M 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-S04J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679512734066

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-S04J06T08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 19:18:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 19:18:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:18:55] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2023-03-22 19:18:55] [INFO ] Transformed 792 places.
[2023-03-22 19:18:55] [INFO ] Transformed 4268 transitions.
[2023-03-22 19:18:55] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Normalized transition count is 2068 out of 2100 initially.
// Phase 1: matrix 2068 rows 792 cols
[2023-03-22 19:18:56] [INFO ] Computed 58 place invariants in 156 ms
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) seen :18
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :13
[2023-03-22 19:18:56] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2023-03-22 19:18:56] [INFO ] Computed 58 place invariants in 68 ms
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 38 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 40 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 19 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 37 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 28 ms returned unsat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-22 19:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:01] [INFO ] [Real]Absence check using state equation in 3565 ms returned sat
[2023-03-22 19:19:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:19:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:19:01] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-22 19:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:06] [INFO ] [Nat]Absence check using state equation in 4907 ms returned unknown
[2023-03-22 19:19:06] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:19:06] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 31 ms returned unsat
[2023-03-22 19:19:06] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:19:06] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 19 ms returned unsat
[2023-03-22 19:19:07] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:19:07] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 20 ms returned unsat
[2023-03-22 19:19:07] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-22 19:19:07] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2, 1, -1, 4, 1, 1, 1] Max seen :[1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 148 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 340 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 500 place count 540 transition count 1852
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 516 place count 540 transition count 1836
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 532 place count 524 transition count 1836
Applied a total of 532 rules in 384 ms. Remains 524 /792 variables (removed 268) and now considering 1836/2100 (removed 264) transitions.
[2023-03-22 19:19:07] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 524 cols
[2023-03-22 19:19:07] [INFO ] Computed 54 place invariants in 38 ms
[2023-03-22 19:19:08] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 432 transitions.
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 524/792 places, 1404/2100 transitions.
Applied a total of 0 rules in 40 ms. Remains 524 /524 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1699 ms. Remains : 524/792 places, 1404/2100 transitions.
Normalized transition count is 1372 out of 1404 initially.
// Phase 1: matrix 1372 rows 524 cols
[2023-03-22 19:19:08] [INFO ] Computed 54 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 107 resets, run finished after 5874 ms. (steps per millisecond=170 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2029 ms. (steps per millisecond=492 ) properties (out of 1) seen :1
[2023-03-22 19:19:16] [INFO ] Flow matrix only has 1372 transitions (discarded 32 similar events)
// Phase 1: matrix 1372 rows 524 cols
[2023-03-22 19:19:16] [INFO ] Computed 54 place invariants in 39 ms
[2023-03-22 19:19:16] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-22 19:19:16] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 21 ms returned sat
[2023-03-22 19:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:18] [INFO ] [Real]Absence check using state equation in 1884 ms returned sat
[2023-03-22 19:19:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:19:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 19:19:19] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned sat
[2023-03-22 19:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:23] [INFO ] [Nat]Absence check using state equation in 4210 ms returned sat
[2023-03-22 19:19:23] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:19:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:19:29] [INFO ] [Nat]Added 160 Read/Feed constraints in 6035 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1404/1404 transitions.
Applied a total of 0 rules in 34 ms. Remains 524 /524 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 524/524 places, 1404/1404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1404/1404 transitions.
Applied a total of 0 rules in 26 ms. Remains 524 /524 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
[2023-03-22 19:19:29] [INFO ] Flow matrix only has 1372 transitions (discarded 32 similar events)
[2023-03-22 19:19:29] [INFO ] Invariant cache hit.
[2023-03-22 19:19:30] [INFO ] Implicit Places using invariants in 784 ms returned [2, 88, 98, 144, 195, 231, 256, 385]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 789 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/524 places, 1404/1404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 510 transition count 1398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 510 transition count 1398
Applied a total of 12 rules in 46 ms. Remains 510 /516 variables (removed 6) and now considering 1398/1404 (removed 6) transitions.
[2023-03-22 19:19:30] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:19:30] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-22 19:19:30] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-22 19:19:30] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:19:30] [INFO ] Invariant cache hit.
[2023-03-22 19:19:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:19:46] [INFO ] Implicit Places using invariants and state equation in 15349 ms returned []
Implicit Place search using SMT with State Equation took 16074 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 510/524 places, 1398/1404 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16937 ms. Remains : 510/524 places, 1398/1404 transitions.
Normalized transition count is 1366 out of 1398 initially.
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:19:46] [INFO ] Computed 46 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 112 resets, run finished after 5623 ms. (steps per millisecond=177 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1930 ms. (steps per millisecond=518 ) properties (out of 1) seen :1
[2023-03-22 19:19:53] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:19:53] [INFO ] Computed 46 place invariants in 29 ms
[2023-03-22 19:19:53] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 19:19:53] [INFO ] [Real]Absence check using 19 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-22 19:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:19:57] [INFO ] [Real]Absence check using state equation in 3399 ms returned sat
[2023-03-22 19:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:19:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 19:19:57] [INFO ] [Nat]Absence check using 19 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-22 19:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:20:03] [INFO ] [Nat]Absence check using state equation in 6282 ms returned sat
[2023-03-22 19:20:03] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:20:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:20:06] [INFO ] [Nat]Added 160 Read/Feed constraints in 3143 ms returned sat
[2023-03-22 19:20:07] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 16 ms to minimize.
[2023-03-22 19:20:08] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:20:09] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2023-03-22 19:20:11] [INFO ] Deduced a trap composed of 225 places in 339 ms of which 17 ms to minimize.
[2023-03-22 19:20:11] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 2 ms to minimize.
[2023-03-22 19:20:12] [INFO ] Deduced a trap composed of 219 places in 256 ms of which 1 ms to minimize.
[2023-03-22 19:20:12] [INFO ] Deduced a trap composed of 237 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:20:12] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:20:13] [INFO ] Deduced a trap composed of 223 places in 281 ms of which 1 ms to minimize.
[2023-03-22 19:20:13] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 3 ms to minimize.
[2023-03-22 19:20:13] [INFO ] Deduced a trap composed of 223 places in 252 ms of which 3 ms to minimize.
[2023-03-22 19:20:14] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 1 ms to minimize.
[2023-03-22 19:20:14] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-22 19:20:15] [INFO ] Deduced a trap composed of 261 places in 271 ms of which 1 ms to minimize.
[2023-03-22 19:20:15] [INFO ] Deduced a trap composed of 229 places in 248 ms of which 1 ms to minimize.
[2023-03-22 19:20:15] [INFO ] Deduced a trap composed of 220 places in 250 ms of which 1 ms to minimize.
[2023-03-22 19:20:16] [INFO ] Deduced a trap composed of 272 places in 271 ms of which 1 ms to minimize.
[2023-03-22 19:20:16] [INFO ] Deduced a trap composed of 217 places in 248 ms of which 0 ms to minimize.
[2023-03-22 19:20:17] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 1 ms to minimize.
[2023-03-22 19:20:17] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 1 ms to minimize.
[2023-03-22 19:20:17] [INFO ] Deduced a trap composed of 249 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:20:18] [INFO ] Deduced a trap composed of 249 places in 257 ms of which 2 ms to minimize.
[2023-03-22 19:20:18] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 11968 ms
[2023-03-22 19:20:19] [INFO ] Computed and/alt/rep : 676/3727/652 causal constraints (skipped 710 transitions) in 134 ms.
[2023-03-22 19:20:26] [INFO ] Deduced a trap composed of 203 places in 272 ms of which 1 ms to minimize.
[2023-03-22 19:20:26] [INFO ] Deduced a trap composed of 234 places in 308 ms of which 0 ms to minimize.
[2023-03-22 19:20:26] [INFO ] Deduced a trap composed of 247 places in 257 ms of which 0 ms to minimize.
[2023-03-22 19:20:27] [INFO ] Deduced a trap composed of 203 places in 264 ms of which 1 ms to minimize.
[2023-03-22 19:20:27] [INFO ] Deduced a trap composed of 212 places in 261 ms of which 1 ms to minimize.
[2023-03-22 19:20:28] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 0 ms to minimize.
[2023-03-22 19:20:31] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 0 ms to minimize.
[2023-03-22 19:20:31] [INFO ] Deduced a trap composed of 243 places in 277 ms of which 1 ms to minimize.
[2023-03-22 19:20:32] [INFO ] Deduced a trap composed of 225 places in 281 ms of which 1 ms to minimize.
[2023-03-22 19:20:32] [INFO ] Deduced a trap composed of 269 places in 267 ms of which 1 ms to minimize.
[2023-03-22 19:20:32] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 1 ms to minimize.
[2023-03-22 19:20:33] [INFO ] Deduced a trap composed of 225 places in 266 ms of which 0 ms to minimize.
[2023-03-22 19:20:33] [INFO ] Deduced a trap composed of 209 places in 255 ms of which 0 ms to minimize.
[2023-03-22 19:20:36] [INFO ] Deduced a trap composed of 249 places in 274 ms of which 0 ms to minimize.
[2023-03-22 19:20:36] [INFO ] Deduced a trap composed of 298 places in 267 ms of which 0 ms to minimize.
[2023-03-22 19:20:36] [INFO ] Deduced a trap composed of 284 places in 269 ms of which 0 ms to minimize.
[2023-03-22 19:20:37] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:20:37] [INFO ] Deduced a trap composed of 256 places in 271 ms of which 1 ms to minimize.
[2023-03-22 19:20:38] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 1 ms to minimize.
[2023-03-22 19:20:39] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 1 ms to minimize.
[2023-03-22 19:20:40] [INFO ] Deduced a trap composed of 219 places in 264 ms of which 0 ms to minimize.
[2023-03-22 19:20:40] [INFO ] Deduced a trap composed of 275 places in 264 ms of which 0 ms to minimize.
[2023-03-22 19:20:40] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 1 ms to minimize.
[2023-03-22 19:20:41] [INFO ] Deduced a trap composed of 268 places in 262 ms of which 1 ms to minimize.
[2023-03-22 19:20:41] [INFO ] Deduced a trap composed of 275 places in 277 ms of which 0 ms to minimize.
[2023-03-22 19:20:41] [INFO ] Deduced a trap composed of 264 places in 262 ms of which 1 ms to minimize.
[2023-03-22 19:20:42] [INFO ] Deduced a trap composed of 281 places in 261 ms of which 1 ms to minimize.
[2023-03-22 19:20:42] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:20:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1398/1398 transitions.
Applied a total of 0 rules in 52 ms. Remains 510 /510 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 510/510 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1398/1398 transitions.
Applied a total of 0 rules in 34 ms. Remains 510 /510 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-22 19:20:42] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:20:42] [INFO ] Invariant cache hit.
[2023-03-22 19:20:43] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-22 19:20:43] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:20:43] [INFO ] Invariant cache hit.
[2023-03-22 19:20:43] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:20:56] [INFO ] Implicit Places using invariants and state equation in 12827 ms returned []
Implicit Place search using SMT with State Equation took 13431 ms to find 0 implicit places.
[2023-03-22 19:20:56] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-22 19:20:56] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:20:56] [INFO ] Invariant cache hit.
[2023-03-22 19:20:57] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14574 ms. Remains : 510/510 places, 1398/1398 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J06T08-UpperBounds-08
Normalized transition count is 1366 out of 1398 initially.
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:20:57] [INFO ] Computed 46 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
[2023-03-22 19:20:57] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:20:57] [INFO ] Computed 46 place invariants in 24 ms
[2023-03-22 19:20:57] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-22 19:20:57] [INFO ] [Real]Absence check using 19 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-22 19:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:00] [INFO ] [Real]Absence check using state equation in 3287 ms returned sat
[2023-03-22 19:21:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:21:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-22 19:21:00] [INFO ] [Nat]Absence check using 19 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-22 19:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:05] [INFO ] [Nat]Absence check using state equation in 4933 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1398/1398 transitions.
Applied a total of 0 rules in 29 ms. Remains 510 /510 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-22 19:21:05] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:21:05] [INFO ] Invariant cache hit.
[2023-03-22 19:21:06] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 510/510 places, 1398/1398 transitions.
Normalized transition count is 1366 out of 1398 initially.
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:21:06] [INFO ] Computed 46 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 102 resets, run finished after 5444 ms. (steps per millisecond=183 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 1) seen :1
[2023-03-22 19:21:14] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
// Phase 1: matrix 1366 rows 510 cols
[2023-03-22 19:21:14] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-22 19:21:14] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 19:21:14] [INFO ] [Real]Absence check using 19 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-22 19:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:17] [INFO ] [Real]Absence check using state equation in 3295 ms returned sat
[2023-03-22 19:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:21:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 19:21:17] [INFO ] [Nat]Absence check using 19 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-22 19:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:21:23] [INFO ] [Nat]Absence check using state equation in 6171 ms returned sat
[2023-03-22 19:21:23] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:21:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 19:21:27] [INFO ] [Nat]Added 160 Read/Feed constraints in 3049 ms returned sat
[2023-03-22 19:21:27] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 2 ms to minimize.
[2023-03-22 19:21:28] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2023-03-22 19:21:29] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-22 19:21:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3576 ms
[2023-03-22 19:21:30] [INFO ] Computed and/alt/rep : 676/3727/652 causal constraints (skipped 710 transitions) in 153 ms.
[2023-03-22 19:21:34] [INFO ] Deduced a trap composed of 250 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:21:35] [INFO ] Deduced a trap composed of 250 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:21:35] [INFO ] Deduced a trap composed of 261 places in 277 ms of which 0 ms to minimize.
[2023-03-22 19:21:35] [INFO ] Deduced a trap composed of 295 places in 273 ms of which 4 ms to minimize.
[2023-03-22 19:21:36] [INFO ] Deduced a trap composed of 216 places in 256 ms of which 1 ms to minimize.
[2023-03-22 19:21:36] [INFO ] Deduced a trap composed of 233 places in 256 ms of which 1 ms to minimize.
[2023-03-22 19:21:36] [INFO ] Deduced a trap composed of 283 places in 264 ms of which 1 ms to minimize.
[2023-03-22 19:21:37] [INFO ] Deduced a trap composed of 257 places in 252 ms of which 0 ms to minimize.
[2023-03-22 19:21:40] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:21:41] [INFO ] Deduced a trap composed of 235 places in 250 ms of which 1 ms to minimize.
[2023-03-22 19:21:42] [INFO ] Deduced a trap composed of 267 places in 264 ms of which 0 ms to minimize.
[2023-03-22 19:21:42] [INFO ] Deduced a trap composed of 282 places in 253 ms of which 0 ms to minimize.
[2023-03-22 19:21:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 8156 ms
[2023-03-22 19:21:43] [INFO ] Added : 81 causal constraints over 17 iterations in 13120 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1398/1398 transitions.
Applied a total of 0 rules in 35 ms. Remains 510 /510 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 510/510 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1398/1398 transitions.
Applied a total of 0 rules in 37 ms. Remains 510 /510 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-22 19:21:46] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:21:46] [INFO ] Invariant cache hit.
[2023-03-22 19:21:47] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-22 19:21:47] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:21:47] [INFO ] Invariant cache hit.
[2023-03-22 19:21:47] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:22:00] [INFO ] Implicit Places using invariants and state equation in 13340 ms returned []
Implicit Place search using SMT with State Equation took 13977 ms to find 0 implicit places.
[2023-03-22 19:22:00] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-22 19:22:00] [INFO ] Flow matrix only has 1366 transitions (discarded 32 similar events)
[2023-03-22 19:22:00] [INFO ] Invariant cache hit.
[2023-03-22 19:22:01] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15123 ms. Remains : 510/510 places, 1398/1398 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J06T08-UpperBounds-08 in 64545 ms.
[2023-03-22 19:22:02] [INFO ] Flatten gal took : 204 ms
[2023-03-22 19:22:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 19:22:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 510 places, 1398 transitions and 7258 arcs took 17 ms.
Total runtime 186841 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBLF (PT), instance S04J06T08
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 510 places, 1398 transitions, 7258 arcs.
Final Score: 128123.229
Took : 24 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9758192 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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-S04J06T08"
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-S04J06T08, 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-167873953200573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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 ;