Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419000495.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LeafsetExtension-PT-S16C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 905K Mar 5 18:22 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 LeafsetExtension-PT-S16C4-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679537456995

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 02:10:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 02:10:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 02:10:58] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-23 02:10:58] [INFO ] Transformed 1542 places.
[2023-03-23 02:10:58] [INFO ] Transformed 1449 transitions.
[2023-03-23 02:10:58] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 297 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 16) seen :7
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :1
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :1
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1449 rows 1542 cols
[2023-03-23 02:10:59] [INFO ] Computed 93 place invariants in 142 ms
[2023-03-23 02:11:00] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-23 02:11:00] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 54 ms returned sat
[2023-03-23 02:11:01] [INFO ] After 1406ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-23 02:11:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-23 02:11:01] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 52 ms returned sat
[2023-03-23 02:11:03] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-23 02:11:03] [INFO ] After 1814ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 538 ms.
[2023-03-23 02:11:04] [INFO ] After 2902ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 12 ms.
Support contains 38 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 765 are kept as prefixes of interest. Removing 777 places using SCC suffix rule.5 ms
Discarding 777 places :
Also discarding 358 output transitions
Drop transitions removed 358 transitions
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 349 rules applied. Total rules applied 350 place count 765 transition count 742
Reduce places removed 237 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 588 place count 528 transition count 741
Reduce places removed 1 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 47 rules applied. Total rules applied 635 place count 527 transition count 695
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 681 place count 481 transition count 695
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 681 place count 481 transition count 676
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 719 place count 462 transition count 676
Discarding 141 places :
Symmetric choice reduction at 4 with 141 rule applications. Total rules 860 place count 321 transition count 535
Iterating global reduction 4 with 141 rules applied. Total rules applied 1001 place count 321 transition count 535
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1008 place count 314 transition count 528
Iterating global reduction 4 with 7 rules applied. Total rules applied 1015 place count 314 transition count 528
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1016 place count 313 transition count 528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1018 place count 312 transition count 527
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1020 place count 312 transition count 525
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1022 place count 310 transition count 525
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 1049 place count 310 transition count 525
Applied a total of 1049 rules in 174 ms. Remains 310 /1542 variables (removed 1232) and now considering 525/1449 (removed 924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 310/1542 places, 525/1449 transitions.
Incomplete random walk after 10000 steps, including 566 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499393 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499393 steps, saw 124566 distinct states, run finished after 3004 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 02:11:07] [INFO ] Flow matrix only has 432 transitions (discarded 93 similar events)
// Phase 1: matrix 432 rows 310 cols
[2023-03-23 02:11:07] [INFO ] Computed 30 place invariants in 8 ms
[2023-03-23 02:11:07] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 5 ms returned sat
[2023-03-23 02:11:07] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 02:11:07] [INFO ] After 229ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-23 02:11:08] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 02:11:08] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 27 ms returned sat
[2023-03-23 02:11:08] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 02:11:08] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-23 02:11:08] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 525/525 transitions.
Applied a total of 0 rules in 27 ms. Remains 310 /310 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 310/310 places, 525/525 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 525/525 transitions.
Applied a total of 0 rules in 20 ms. Remains 310 /310 variables (removed 0) and now considering 525/525 (removed 0) transitions.
[2023-03-23 02:11:08] [INFO ] Flow matrix only has 432 transitions (discarded 93 similar events)
[2023-03-23 02:11:08] [INFO ] Invariant cache hit.
[2023-03-23 02:11:08] [INFO ] Implicit Places using invariants in 231 ms returned [3, 17, 27, 30, 40, 68, 71, 94, 111, 122, 125, 135, 137, 139, 185, 212, 226, 255, 279]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 235 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/310 places, 525/525 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 205 transition count 439
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 205 transition count 439
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 183 place count 194 transition count 428
Iterating global reduction 0 with 11 rules applied. Total rules applied 194 place count 194 transition count 428
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 227 place count 161 transition count 395
Iterating global reduction 0 with 33 rules applied. Total rules applied 260 place count 161 transition count 395
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 272 place count 155 transition count 389
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 276 place count 155 transition count 385
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 280 place count 151 transition count 385
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 281 place count 151 transition count 385
Applied a total of 281 rules in 55 ms. Remains 151 /291 variables (removed 140) and now considering 385/525 (removed 140) transitions.
[2023-03-23 02:11:08] [INFO ] Flow matrix only has 212 transitions (discarded 173 similar events)
// Phase 1: matrix 212 rows 151 cols
[2023-03-23 02:11:08] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-23 02:11:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-23 02:11:08] [INFO ] Flow matrix only has 212 transitions (discarded 173 similar events)
[2023-03-23 02:11:08] [INFO ] Invariant cache hit.
[2023-03-23 02:11:09] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [63, 73, 105, 109, 112, 123, 135, 137, 144]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 266 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/310 places, 385/525 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 142 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 384
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 25 place count 118 transition count 361
Iterating global reduction 0 with 23 rules applied. Total rules applied 48 place count 118 transition count 361
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 114 transition count 357
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 114 transition count 354
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 62 place count 111 transition count 354
Applied a total of 62 rules in 24 ms. Remains 111 /142 variables (removed 31) and now considering 354/385 (removed 31) transitions.
[2023-03-23 02:11:09] [INFO ] Flow matrix only has 180 transitions (discarded 174 similar events)
// Phase 1: matrix 180 rows 111 cols
[2023-03-23 02:11:09] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-23 02:11:09] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-23 02:11:09] [INFO ] Flow matrix only has 180 transitions (discarded 174 similar events)
[2023-03-23 02:11:09] [INFO ] Invariant cache hit.
[2023-03-23 02:11:09] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 111/310 places, 354/525 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 810 ms. Remains : 111/310 places, 354/525 transitions.
Incomplete random walk after 10000 steps, including 747 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 248237 steps, run visited all 1 properties in 836 ms. (steps per millisecond=296 )
Probabilistic random walk after 248237 steps, saw 55560 distinct states, run finished after 837 ms. (steps per millisecond=296 ) properties seen :1
FORMULA LeafsetExtension-PT-S16C4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11626 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/485/inv_0_ --invariant=/tmp/485/inv_1_ --invariant=/tmp/485/inv_2_ --invariant=/tmp/485/inv_3_ --invariant=/tmp/485/inv_4_ --invariant=/tmp/485/inv_5_ --invariant=/tmp/485/inv_6_ --invariant=/tmp/485/inv_7_ --invariant=/tmp/485/inv_8_ --invariant=/tmp/485/inv_9_ --invariant=/tmp/485/inv_10_ --invariant=/tmp/485/inv_11_ --invariant=/tmp/485/inv_12_ --invariant=/tmp/485/inv_13_ --invariant=/tmp/485/inv_14_ --invariant=/tmp/485/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 13956800 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094568 kB
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-00
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-01
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-02
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-03
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-04
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-05
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-06
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-07
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-08
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-09
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-10
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-11
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-12
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-13
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-14
Could not compute solution for formula : LeafsetExtension-PT-S16C4-ReachabilityFireability-15

BK_STOP 1679541042448

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_0_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-01
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_1_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_2_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/485/inv_3_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_4_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_5_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_6_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_7_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_8_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_9_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_10_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/485/inv_11_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/485/inv_12_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/485/inv_13_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/485/inv_14_
rfs formula name LeafsetExtension-PT-S16C4-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/485/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 1542 places, 1449 transitions and 4668 arcs
pnml2lts-sym: Petri net gen analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1449->1449 groups
pnml2lts-sym: Regrouping took 1.330 real 1.320 user 0.000 sys
pnml2lts-sym: state vector length is 1542; there are 1449 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 491
Killing (9) : 491

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="LeafsetExtension-PT-S16C4"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is LeafsetExtension-PT-S16C4, 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 r233-tall-167856419000495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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