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.r516-tajo-171654447200461.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 ltsminxred
Input is PolyORBNT-PT-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 PolyORBNT-PT-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717260346346

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:45:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:45:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:45:48] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-06-01 16:45:48] [INFO ] Transformed 629 places.
[2024-06-01 16:45:48] [INFO ] Transformed 1590 transitions.
[2024-06-01 16:45:48] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 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:[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 16:45:48] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-06-01 16:45:48] [INFO ] Computed 102 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[205, 1, 136, 212, 136, 174, 10, 4, 1, 52, 1, 136, 1, 2, 3, 1]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (699 resets) in 186 ms. (53 steps per ms)
FORMULA PolyORBNT-PT-S05J40-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (1690 resets) in 395 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 1, 1, 4, 1, 0, 1, 1, 0] Max Struct:[205, 136, 212, 136, 174, 10, 4, 1, 52, 136, 1]
[2024-06-01 16:45:48] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2024-06-01 16:45:48] [INFO ] Invariant cache hit.
[2024-06-01 16:45:49] [INFO ] [Real]Absence check using 76 positive place invariants in 29 ms returned sat
[2024-06-01 16:45:49] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 16:45:49] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-06-01 16:45:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:45:49] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2024-06-01 16:45:49] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 15 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Nat]Absence check using state equation in 2239 ms returned unknown
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 17 ms returned unsat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 21 ms returned unsat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 25 ms returned unsat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned unsat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:45:52] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 16:45:54] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2024-06-01 16:45:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:45:54] [INFO ] [Nat]Absence check using 76 positive place invariants in 23 ms returned sat
[2024-06-01 16:45:54] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 16:45:55] [INFO ] [Nat]Absence check using state equation in 1314 ms returned sat
[2024-06-01 16:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:45:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 470 ms returned sat
[2024-06-01 16:45:56] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 116 ms.
[2024-06-01 16:45:58] [INFO ] Added : 40 causal constraints over 8 iterations in 2662 ms. Result :unknown
[2024-06-01 16:45:59] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2024-06-01 16:45:59] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 23 ms returned unsat
[2024-06-01 16:45:59] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:45:59] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 23 ms returned sat
[2024-06-01 16:46:00] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2024-06-01 16:46:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:46:00] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2024-06-01 16:46:00] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned sat
[2024-06-01 16:46:01] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-06-01 16:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2024-06-01 16:46:01] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 83 ms.
[2024-06-01 16:46:01] [INFO ] Added : 9 causal constraints over 2 iterations in 366 ms. Result :sat
Minimization took 743 ms.
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive place invariants in 21 ms returned sat
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 22 ms returned unsat
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2024-06-01 16:46:02] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 17 ms returned sat
[2024-06-01 16:46:04] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2024-06-01 16:46:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:46:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 21 ms returned sat
[2024-06-01 16:46:04] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 40 ms returned sat
[2024-06-01 16:46:05] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2024-06-01 16:46:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 303 ms returned sat
[2024-06-01 16:46:06] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 141 ms.
[2024-06-01 16:46:07] [INFO ] Added : 75 causal constraints over 16 iterations in 1695 ms. Result :sat
Minimization took 571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 1, 1, 4, 1, 0, 1, 1, 0] Max Struct:[205, 1, 4, 1, 1, 10, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4, 0, 0] Max Struct:[205, 10, 1, 1]
Support contains 208 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 624 transition count 890
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 579 transition count 890
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 95 place count 579 transition count 845
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 531 transition count 842
Applied a total of 191 rules in 351 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
Running 836 sub problems to find dead transitions.
[2024-06-01 16:46:08] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2024-06-01 16:46:08] [INFO ] Computed 97 invariants in 32 ms
[2024-06-01 16:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/531 variables, 5/97 constraints. Problems are: Problem set: 95 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1369 variables, and 97 constraints, problems are : Problem set: 95 solved, 741 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 75/75 constraints. Problems are: Problem set: 95 solved, 741 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 17/92 constraints. Problems are: Problem set: 95 solved, 741 unsolved
[2024-06-01 16:46:41] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 1/93 constraints. Problems are: Problem set: 95 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1369 variables, and 93 constraints, problems are : Problem set: 95 solved, 741 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/836 constraints, Known Traps: 1/1 constraints]
After SMT, in 42799ms problems are : Problem set: 95 solved, 741 unsolved
Search for dead transitions found 95 dead transitions in 42849ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 531/629 places, 747/935 transitions.
Applied a total of 0 rules in 22 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43261 ms. Remains : 531/629 places, 747/935 transitions.
[2024-06-01 16:46:51] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-06-01 16:46:51] [INFO ] Computed 97 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4, 0, 0] Max Struct:[205, 10, 1, 1]
RANDOM walk for 1000000 steps (52044 resets) in 7869 ms. (127 steps per ms)
FORMULA PolyORBNT-PT-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (8074 resets) in 4944 ms. (404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[205, 10]
[2024-06-01 16:47:04] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-06-01 16:47:04] [INFO ] Invariant cache hit.
[2024-06-01 16:47:04] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2024-06-01 16:47:04] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2024-06-01 16:47:05] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2024-06-01 16:47:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:47:05] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:47:05] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2024-06-01 16:47:06] [INFO ] [Nat]Absence check using state equation in 1058 ms returned unsat
[2024-06-01 16:47:06] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2024-06-01 16:47:06] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2024-06-01 16:47:07] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2024-06-01 16:47:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:47:07] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:47:07] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2024-06-01 16:47:08] [INFO ] [Nat]Absence check using state equation in 1177 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[4, 4]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-00 4 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 5 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 80717 ms.
ITS solved all properties within timeout

BK_STOP 1717260428482

--------------------
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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S05J40, 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 r516-tajo-171654447200461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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