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-171654446800285.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 PolyORBLF-PT-S04J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K 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 4.2M 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-S04J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717254177745

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:02:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:02:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:02:59] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-06-01 15:02:59] [INFO ] Transformed 870 places.
[2024-06-01 15:02:59] [INFO ] Transformed 5034 transitions.
[2024-06-01 15:02:59] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 1, 0, 0, 0, 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:[1, 0, 1, 0, 0, 0, 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 15:02:59] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-06-01 15:02:59] [INFO ] Computed 58 invariants in 201 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[10, 777, 1, 610, 450, 1, 450, 40, +inf, 20, +inf, 10, +inf, +inf, 1, 1]
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 202 ms. (49 steps per ms)
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (25 resets) in 449 ms. (266 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 1, 1, 4, 4, 1, 1, 1, 1, 1] Max Struct:[10, 777, 610, 450, 450, 40, +inf, 20, +inf, 10, +inf, +inf]
[2024-06-01 15:03:00] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:03:00] [INFO ] Invariant cache hit.
[2024-06-01 15:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned unsat
[2024-06-01 15:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 10 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 14 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 38 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 15:03:01] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 59 ms returned unsat
[2024-06-01 15:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:03:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 24 ms returned unsat
[2024-06-01 15:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 15:03:02] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 37 ms returned sat
[2024-06-01 15:03:04] [INFO ] [Real]Absence check using state equation in 2207 ms returned sat
[2024-06-01 15:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:03:04] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 35 ms returned sat
[2024-06-01 15:03:07] [INFO ] [Nat]Absence check using state equation in 2657 ms returned unknown
[2024-06-01 15:03:07] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:03:07] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 27 ms returned sat
[2024-06-01 15:03:09] [INFO ] [Real]Absence check using state equation in 2178 ms returned sat
[2024-06-01 15:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-06-01 15:03:10] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 33 ms returned sat
[2024-06-01 15:03:12] [INFO ] [Nat]Absence check using state equation in 2405 ms returned unknown
[2024-06-01 15:03:12] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-06-01 15:03:12] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 1, 1, 4, 4, 1, 1, 1, 1, 1] Max Struct:[1, 1, 2, 1, 1, 4, 4, 1, 1, 10, +inf, 1]
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[10, +inf]
Support contains 2 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 866 transition count 2235
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 183 place count 777 transition count 2234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 776 transition count 2234
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 184 place count 776 transition count 2135
Deduced a syphon composed of 99 places in 4 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 382 place count 677 transition count 2135
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 580 place count 578 transition count 2036
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 600 place count 578 transition count 2016
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 620 place count 558 transition count 2016
Applied a total of 620 rules in 545 ms. Remains 558 /870 variables (removed 312) and now considering 2016/2324 (removed 308) transitions.
Running 2012 sub problems to find dead transitions.
[2024-06-01 15:03:13] [INFO ] Flow matrix only has 1976 transitions (discarded 40 similar events)
// Phase 1: matrix 1976 rows 558 cols
[2024-06-01 15:03:13] [INFO ] Computed 54 invariants in 94 ms
[2024-06-01 15:03:13] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2012 unsolved
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 14 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 2 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 199 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 3 ms to minimize.
[2024-06-01 15:03:48] [INFO ] Deduced a trap composed of 187 places in 501 ms of which 4 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 79 places in 470 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/2534 variables, and 64 constraints, problems are : Problem set: 0 solved, 2012 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/558 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2012/2012 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2012 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2012 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2012 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2012 unsolved
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 271 places in 403 ms of which 4 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 260 places in 473 ms of which 4 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 259 places in 395 ms of which 3 ms to minimize.
[2024-06-01 15:04:09] [INFO ] Deduced a trap composed of 228 places in 518 ms of which 4 ms to minimize.
[2024-06-01 15:04:10] [INFO ] Deduced a trap composed of 230 places in 634 ms of which 4 ms to minimize.
SMT process timed out in 56783ms, After SMT, problems are : Problem set: 0 solved, 2012 unsolved
Search for dead transitions found 0 dead transitions in 56840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57428 ms. Remains : 558/870 places, 2016/2324 transitions.
[2024-06-01 15:04:10] [INFO ] Flow matrix only has 1976 transitions (discarded 40 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 15:47:04] [INFO ] Flow matrix only has 1976 transitions (discarded 40 similar events)
[2024-06-01 15:47:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[10, +inf]
RANDOM walk for 1000000 steps (60 resets) in 10233 ms. (97 steps per ms)
BEST_FIRST walk for 2000001 steps (20 resets) in 6961 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[10, +inf]
[2024-06-01 15:47:21] [INFO ] Flow matrix only has 1976 transitions (discarded 40 similar events)
[2024-06-01 15:47:21] [INFO ] Invariant cache hit.
[2024-06-01 15:47:21] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 15:47:21] [INFO ] [Real]Absence check using 12 positive and 42 generalized place invariants in 26 ms returned sat
[2024-06-01 15:47:22] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2024-06-01 15:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:47:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2024-06-01 15:47:22] [INFO ] [Nat]Absence check using 12 positive and 42 generalized place invariants in 35 ms returned sat
[2024-06-01 15:47:23] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-06-01 15:47:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:47:25] [INFO ] [Nat]Added 200 Read/Feed constraints in 1911 ms returned sat
[2024-06-01 15:47:25] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:47:26] [INFO ] Deduced a trap composed of 65 places in 353 ms of which 3 ms to minimize.
[2024-06-01 15:47:27] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:47:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2360 ms
[2024-06-01 15:47:28] [INFO ] Computed and/alt/rep : 952/2778/922 causal constraints (skipped 1050 transitions) in 235 ms.
[2024-06-01 15:47:30] [INFO ] Added : 45 causal constraints over 9 iterations in 1882 ms. Result :sat
Minimization took 5097 ms.
[2024-06-01 15:47:35] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 15:47:35] [INFO ] [Real]Absence check using 12 positive and 42 generalized place invariants in 28 ms returned sat
[2024-06-01 15:47:37] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2024-06-01 15:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:47:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 15:47:37] [INFO ] [Nat]Absence check using 12 positive and 42 generalized place invariants in 24 ms returned sat
[2024-06-01 15:47:43] [INFO ] [Nat]Absence check using state equation in 5781 ms returned sat
[2024-06-01 15:47:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 512 ms returned sat
[2024-06-01 15:47:43] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:47:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3357 ms
[2024-06-01 15:47:47] [INFO ] Computed and/alt/rep : 952/2778/922 causal constraints (skipped 1050 transitions) in 185 ms.
[2024-06-01 15:47:49] [INFO ] Added : 35 causal constraints over 7 iterations in 2319 ms. Result :sat
Minimization took 5151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[10, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[10, +inf]
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 2016/2016 transitions.
Applied a total of 0 rules in 98 ms. Remains 558 /558 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 558/558 places, 2016/2016 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 2016/2016 transitions.
Applied a total of 0 rules in 65 ms. Remains 558 /558 variables (removed 0) and now considering 2016/2016 (removed 0) transitions.
[2024-06-01 15:47:54] [INFO ] Flow matrix only has 1976 transitions (discarded 40 similar events)
[2024-06-01 15:47:54] [INFO ] Invariant cache hit.
[2024-06-01 15:47:55] [INFO ] Implicit Places using invariants in 968 ms returned [104, 178, 224, 225, 249, 321, 337, 399, 460, 552]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 979 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 548/558 places, 2016/2016 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 542 transition count 2010
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 542 transition count 2010
Applied a total of 12 rules in 81 ms. Remains 542 /548 variables (removed 6) and now considering 2010/2016 (removed 6) transitions.
[2024-06-01 15:47:55] [INFO ] Flow matrix only has 1970 transitions (discarded 40 similar events)
// Phase 1: matrix 1970 rows 542 cols
[2024-06-01 15:47:55] [INFO ] Computed 44 invariants in 64 ms
[2024-06-01 15:47:56] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-06-01 15:47:56] [INFO ] Flow matrix only has 1970 transitions (discarded 40 similar events)
[2024-06-01 15:47:56] [INFO ] Invariant cache hit.
[2024-06-01 15:47:58] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:48:17] [INFO ] Implicit Places using invariants and state equation in 20806 ms returned []
Implicit Place search using SMT with State Equation took 21773 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 542/558 places, 2010/2016 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22898 ms. Remains : 542/558 places, 2010/2016 transitions.
[2024-06-01 15:48:17] [INFO ] Flow matrix only has 1970 transitions (discarded 40 similar events)

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.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-S04J04T10"
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 PolyORBLF-PT-S04J04T10, 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-171654446800285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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