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-171654447300503.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-S10J40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K 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 14M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J40-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717261629509

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:07:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:07:11] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2024-06-01 17:07:11] [INFO ] Transformed 854 places.
[2024-06-01 17:07:11] [INFO ] Transformed 12340 transitions.
[2024-06-01 17:07:11] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 818 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 97 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:07:11] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 17:07:11] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 17:07:11] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 17:07:11] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 17:07:11] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2242 resets) in 3662 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 598 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 196 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 878 ms. (4 steps per ms) remains 13/16 properties
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (40 resets) in 131 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (40 resets) in 263 ms. (15 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (40 resets) in 135 ms. (29 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 11/13 properties
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (28 resets) in 67 ms. (58 steps per ms) remains 10/11 properties
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 10/10 properties
[2024-06-01 17:07:13] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-06-01 17:07:13] [INFO ] Computed 112 invariants in 98 ms
[2024-06-01 17:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/850 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/850 variables, 29/109 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 0/109 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/852 variables, 1/110 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/852 variables, 0/110 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J40-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 2/854 variables, 2/112 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/854 variables, 0/112 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2221/3075 variables, 854/966 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3075 variables, 1/967 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3075/3075 variables, and 967 constraints, problems are : Problem set: 8 solved, 2 unsolved in 3659 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 854/854 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 42/42 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/63 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/63 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/844 variables, 39/102 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 1/103 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/854 variables, 9/112 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-06-01 17:07:26] [INFO ] Deduced a trap composed of 34 places in 681 ms of which 53 ms to minimize.
[2024-06-01 17:07:27] [INFO ] Deduced a trap composed of 24 places in 621 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 2/114 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/114 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2221/3075 variables, 854/968 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3075 variables, 1/969 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3075 variables, 1/970 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3075 variables, 0/970 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3075 variables, 0/970 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3075/3075 variables, and 970 constraints, problems are : Problem set: 8 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 854/854 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 16583ms problems are : Problem set: 8 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 760 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 853 transition count 2229
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 853 transition count 2229
Applied a total of 2 rules in 175 ms. Remains 853 /854 variables (removed 1) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-06-01 17:07:30] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 853 cols
[2024-06-01 17:07:30] [INFO ] Computed 112 invariants in 120 ms
[2024-06-01 17:07:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 38226ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 38254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38453 ms. Remains : 853/854 places, 2229/2230 transitions.
RANDOM walk for 40000 steps (2240 resets) in 1154 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (418 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (436 resets) in 9457 ms. (4 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175592 steps, run timeout after 6001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 175592 steps, saw 51917 distinct states, run finished after 6004 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 17:08:17] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-06-01 17:08:17] [INFO ] Invariant cache hit.
[2024-06-01 17:08:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/844 variables, 39/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/853 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2220/3073 variables, 853/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3073 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3073 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3073 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3073/3073 variables, and 966 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3347 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 853/853 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/760 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/844 variables, 39/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/853 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:08:24] [INFO ] Deduced a trap composed of 144 places in 628 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:08:24] [INFO ] Deduced a trap composed of 24 places in 619 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2220/3073 variables, 853/967 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3073 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3073/3073 variables, and 969 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32062 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 853/853 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 37084ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 425 ms.
Support contains 2 out of 853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 853/853 places, 2229/2229 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 843 transition count 2185
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 99 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 100 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 188 place count 754 transition count 2140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 194 place count 751 transition count 2137
Applied a total of 194 rules in 343 ms. Remains 751 /853 variables (removed 102) and now considering 2137/2229 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 751/853 places, 2137/2229 transitions.
RANDOM walk for 1106 steps (79 resets) in 29 ms. (36 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J40-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 104825 ms.
ITS solved all properties within timeout

BK_STOP 1717261735590

--------------------
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 ReachabilityFireability -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-S10J40"
export BK_EXAMINATION="ReachabilityFireability"
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-S10J40, examination is ReachabilityFireability"
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-171654447300503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J40.tgz
mv PolyORBNT-PT-S10J40 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;