Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500269.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 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-S04J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716863711257

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 02:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:35:13] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-05-28 02:35:13] [INFO ] Transformed 554 places.
[2024-05-28 02:35:13] [INFO ] Transformed 2998 transitions.
[2024-05-28 02:35:13] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 02:35:13] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-28 02:35:13] [INFO ] Computed 50 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[696, 6, 2070, +inf, 6, 1, 132, +inf, 19, 4, 345, +inf, +inf, 460, +inf, 1]
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 113 ms. (87 steps per ms)
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140007 steps (33 resets) in 539 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 5, 1, 3, 4, 1, 1, 3, 1, 1, 2, 1] Max Struct:[696, 6, 2070, +inf, 6, 132, +inf, 19, 4, 345, +inf, +inf, 460, +inf]
[2024-05-28 02:35:14] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 02:35:14] [INFO ] Invariant cache hit.
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 35 ms returned unsat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned unsat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 12 ms returned unsat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 02:35:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-28 02:35:16] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2024-05-28 02:35:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:35:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:35:16] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-28 02:35:17] [INFO ] [Nat]Absence check using state equation in 1485 ms returned sat
[2024-05-28 02:35:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:35:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 408 ms returned sat
[2024-05-28 02:35:18] [INFO ] Deduced a trap composed of 131 places in 444 ms of which 31 ms to minimize.
[2024-05-28 02:35:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 558 ms
[2024-05-28 02:35:18] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned unsat
[2024-05-28 02:35:18] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-28 02:35:18] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-28 02:35:20] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2024-05-28 02:35:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:35:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:35:20] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 25 ms returned sat
[2024-05-28 02:35:22] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2024-05-28 02:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:35:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 1020 ms returned unknown
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 15 ms returned unsat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 02:35:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 14 ms returned unsat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 23 ms returned unsat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 18 ms returned unsat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 02:35:24] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 5, 1, 3, 4, 1, 1, 3, 1, 1, 2, 1] Max Struct:[1, 1, 3, 5, 1, 132, 4, 1, 1, 3, 1, 1, 2, 1]
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[132]
Support contains 24 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 550 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 112 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 232 place count 436 transition count 1258
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 376 transition count 1198
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 364 place count 376 transition count 1186
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 376 place count 364 transition count 1186
Applied a total of 376 rules in 299 ms. Remains 364 /554 variables (removed 190) and now considering 1186/1372 (removed 186) transitions.
Running 1182 sub problems to find dead transitions.
[2024-05-28 02:35:24] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
// Phase 1: matrix 1162 rows 364 cols
[2024-05-28 02:35:24] [INFO ] Computed 46 invariants in 24 ms
[2024-05-28 02:35:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-28 02:35:38] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 02:35:38] [INFO ] Deduced a trap composed of 53 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:35:38] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 3 ms to minimize.
[2024-05-28 02:35:40] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:35:43] [INFO ] Deduced a trap composed of 114 places in 221 ms of which 6 ms to minimize.
[2024-05-28 02:35:43] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1526 variables, and 47 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1182/1182 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-28 02:35:52] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-28 02:35:52] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:35:53] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:35:53] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-28 02:35:53] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:35:55] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1526 variables, and 53 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1182 constraints, Known Traps: 12/12 constraints]
After SMT, in 46769ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 46808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47129 ms. Remains : 364/554 places, 1186/1372 transitions.
[2024-05-28 02:36:11] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-05-28 02:36:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[132]
RANDOM walk for 1000000 steps (146 resets) in 6993 ms. (142 steps per ms)
BEST_FIRST walk for 1000000 steps (1058 resets) in 2944 ms. (339 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[132]
[2024-05-28 02:36:21] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-05-28 02:36:21] [INFO ] Invariant cache hit.
[2024-05-28 02:36:21] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 02:36:21] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 11 ms returned sat
[2024-05-28 02:36:22] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-28 02:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:36:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 02:36:22] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 13 ms returned sat
[2024-05-28 02:36:24] [INFO ] [Nat]Absence check using state equation in 1849 ms returned sat
[2024-05-28 02:36:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:36:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 585 ms returned sat
[2024-05-28 02:36:25] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 3 ms to minimize.
[2024-05-28 02:36:25] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 2 ms to minimize.
[2024-05-28 02:36:25] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-05-28 02:36:26] [INFO ] Deduced a trap composed of 146 places in 298 ms of which 2 ms to minimize.
[2024-05-28 02:36:26] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-05-28 02:36:26] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 2 ms to minimize.
[2024-05-28 02:36:27] [INFO ] Deduced a trap composed of 94 places in 195 ms of which 2 ms to minimize.
[2024-05-28 02:36:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2354 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[3]
FORMULA PolyORBLF-PT-S04J04T06-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 74258 ms.
ITS solved all properties within timeout

BK_STOP 1716863787130

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S04J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J04T06, 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 r289-tajo-171654445500269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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