Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978200471.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d2m18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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 SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679318272646

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=SieveSingleMsgMbox-PT-d2m18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:17:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:17:54] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-20 13:17:54] [INFO ] Transformed 2398 places.
[2023-03-20 13:17:54] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:17:54] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 15 ms
Reduce places removed 1984 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 182553 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{1=1, 2=1, 11=1, 12=1, 15=1}
Probabilistic random walk after 182553 steps, saw 82870 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 13:17:58] [INFO ] Computed 6 place invariants in 38 ms
[2023-03-20 13:17:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:17:59] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:17:59] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-20 13:18:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:18:00] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:18:02] [INFO ] After 2086ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2023-03-20 13:18:02] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 13:18:05] [INFO ] After 3622ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :5 sat :6
[2023-03-20 13:18:06] [INFO ] Deduced a trap composed of 101 places in 276 ms of which 9 ms to minimize.
[2023-03-20 13:18:06] [INFO ] Deduced a trap composed of 155 places in 237 ms of which 1 ms to minimize.
[2023-03-20 13:18:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 851 ms
[2023-03-20 13:18:08] [INFO ] Deduced a trap composed of 206 places in 195 ms of which 1 ms to minimize.
[2023-03-20 13:18:09] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 2 ms to minimize.
[2023-03-20 13:18:09] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 1 ms to minimize.
[2023-03-20 13:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1581 ms
[2023-03-20 13:18:12] [INFO ] Deduced a trap composed of 122 places in 97 ms of which 1 ms to minimize.
[2023-03-20 13:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-20 13:18:12] [INFO ] After 10044ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 4398 ms.
[2023-03-20 13:18:16] [INFO ] After 16790ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 40 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 920 place count 299 transition count 830
Iterating global reduction 1 with 89 rules applied. Total rules applied 1009 place count 299 transition count 830
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1019 place count 299 transition count 820
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1081 place count 237 transition count 758
Iterating global reduction 2 with 62 rules applied. Total rules applied 1143 place count 237 transition count 758
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1176 place count 237 transition count 725
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1199 place count 214 transition count 699
Iterating global reduction 3 with 23 rules applied. Total rules applied 1222 place count 214 transition count 699
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 1312 place count 214 transition count 609
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1318 place count 208 transition count 598
Iterating global reduction 4 with 6 rules applied. Total rules applied 1324 place count 208 transition count 598
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1330 place count 202 transition count 592
Iterating global reduction 4 with 6 rules applied. Total rules applied 1336 place count 202 transition count 592
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1339 place count 199 transition count 589
Iterating global reduction 4 with 3 rules applied. Total rules applied 1342 place count 199 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1343 place count 198 transition count 588
Iterating global reduction 4 with 1 rules applied. Total rules applied 1344 place count 198 transition count 588
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1345 place count 197 transition count 587
Iterating global reduction 4 with 1 rules applied. Total rules applied 1346 place count 197 transition count 587
Applied a total of 1346 rules in 202 ms. Remains 197 /414 variables (removed 217) and now considering 587/1954 (removed 1367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 197/414 places, 587/1954 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 289635 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289635 steps, saw 136149 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 587 rows 197 cols
[2023-03-20 13:18:20] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-20 13:18:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:18:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 13:18:20] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 13:18:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:18:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:18:21] [INFO ] After 637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 13:18:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-03-20 13:18:22] [INFO ] After 793ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 13:18:23] [INFO ] After 1622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 917 ms.
[2023-03-20 13:18:24] [INFO ] After 3296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 40 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 587/587 transitions.
Applied a total of 0 rules in 55 ms. Remains 197 /197 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 197/197 places, 587/587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 587/587 transitions.
Applied a total of 0 rules in 63 ms. Remains 197 /197 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2023-03-20 13:18:24] [INFO ] Invariant cache hit.
[2023-03-20 13:18:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-20 13:18:24] [INFO ] Invariant cache hit.
[2023-03-20 13:18:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-03-20 13:18:25] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2023-03-20 13:18:25] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-20 13:18:25] [INFO ] Invariant cache hit.
[2023-03-20 13:18:26] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 197/197 places, 587/587 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 581
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 192 transition count 581
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 192 transition count 565
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 176 transition count 565
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 67 place count 164 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 163 transition count 553
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 163 transition count 551
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 163 transition count 547
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 80 place count 159 transition count 546
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 159 transition count 546
Applied a total of 92 rules in 71 ms. Remains 159 /197 variables (removed 38) and now considering 546/587 (removed 41) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 546 rows 159 cols
[2023-03-20 13:18:26] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 13:18:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:18:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:18:26] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 13:18:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:18:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:18:26] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 13:18:26] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2023-03-20 13:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-20 13:18:26] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2023-03-20 13:18:26] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2023-03-20 13:18:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-20 13:18:27] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2023-03-20 13:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-20 13:18:27] [INFO ] After 1101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-20 13:18:27] [INFO ] After 1586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 13:18:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 13:18:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 587 transitions and 2320 arcs took 13 ms.
[2023-03-20 13:18:28] [INFO ] Flatten gal took : 96 ms
Total runtime 33953 ms.
There are residual formulas that ITS could not solve within timeout
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/533/inv_0_ --invariant=/tmp/533/inv_1_ --invariant=/tmp/533/inv_2_ --invariant=/tmp/533/inv_3_ --invariant=/tmp/533/inv_4_ --invariant=/tmp/533/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15355180 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099144 kB

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//
++ 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

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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r425-tajo-167905978200471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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