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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 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-d2m96-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679321101221

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-d2m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 14:05:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 14:05:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:05:03] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-20 14:05:03] [INFO ] Transformed 2398 places.
[2023-03-20 14:05:03] [INFO ] Transformed 1954 transitions.
[2023-03-20 14:05:03] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 14 ms
Reduce places removed 1984 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 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 41 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 44 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 53 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 42 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 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 48 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 158559 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{2=1, 4=1, 6=1, 13=1, 14=1}
Probabilistic random walk after 158559 steps, saw 72563 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 14:05:06] [INFO ] Computed 6 place invariants in 39 ms
[2023-03-20 14:05:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 14:05:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 14:05:08] [INFO ] After 1546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 14:05:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 14:05:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 14:05:11] [INFO ] After 2576ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-20 14:05:11] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 14:05:15] [INFO ] After 3951ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2023-03-20 14:05:16] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 9 ms to minimize.
[2023-03-20 14:05:17] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 1 ms to minimize.
[2023-03-20 14:05:17] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-20 14:05:17] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 1 ms to minimize.
[2023-03-20 14:05:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1066 ms
[2023-03-20 14:05:22] [INFO ] After 10764ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 6877 ms.
[2023-03-20 14:05:29] [INFO ] After 20638ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 982 ms.
Support contains 23 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.10 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 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 934 place count 285 transition count 588
Iterating global reduction 1 with 103 rules applied. Total rules applied 1037 place count 285 transition count 588
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1047 place count 285 transition count 578
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 1123 place count 209 transition count 502
Iterating global reduction 2 with 76 rules applied. Total rules applied 1199 place count 209 transition count 502
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1233 place count 209 transition count 468
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1260 place count 182 transition count 435
Iterating global reduction 3 with 27 rules applied. Total rules applied 1287 place count 182 transition count 435
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1325 place count 182 transition count 397
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1331 place count 176 transition count 387
Iterating global reduction 4 with 6 rules applied. Total rules applied 1337 place count 176 transition count 387
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1343 place count 170 transition count 381
Iterating global reduction 4 with 6 rules applied. Total rules applied 1349 place count 170 transition count 381
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1352 place count 167 transition count 377
Iterating global reduction 4 with 3 rules applied. Total rules applied 1355 place count 167 transition count 377
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1357 place count 165 transition count 375
Iterating global reduction 4 with 2 rules applied. Total rules applied 1359 place count 165 transition count 375
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1361 place count 163 transition count 373
Iterating global reduction 4 with 2 rules applied. Total rules applied 1363 place count 163 transition count 373
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1364 place count 162 transition count 372
Iterating global reduction 4 with 1 rules applied. Total rules applied 1365 place count 162 transition count 372
Applied a total of 1365 rules in 147 ms. Remains 162 /414 variables (removed 252) and now considering 372/1954 (removed 1582) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 162/414 places, 372/1954 transitions.
Incomplete random walk after 10000 steps, including 2189 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 320140 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{2=1}
Probabilistic random walk after 320140 steps, saw 146392 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 372 rows 162 cols
[2023-03-20 14:05:34] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-20 14:05:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:05:34] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 14:05:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:05:35] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 14:05:35] [INFO ] State equation strengthened by 250 read => feed constraints.
[2023-03-20 14:05:36] [INFO ] After 649ms SMT Verify possible using 250 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 14:05:37] [INFO ] After 1795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 840 ms.
[2023-03-20 14:05:37] [INFO ] After 3120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 198 ms.
Support contains 22 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 372/372 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 161 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 160 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 160 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 159 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 159 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 159 transition count 353
Applied a total of 7 rules in 29 ms. Remains 159 /162 variables (removed 3) and now considering 353/372 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 159/162 places, 353/372 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 301798 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1}
Probabilistic random walk after 301798 steps, saw 134854 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 353 rows 159 cols
[2023-03-20 14:05:42] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:05:42] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 14:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:05:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:05:43] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:43] [INFO ] State equation strengthened by 234 read => feed constraints.
[2023-03-20 14:05:43] [INFO ] After 560ms SMT Verify possible using 234 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:44] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 649 ms.
[2023-03-20 14:05:44] [INFO ] After 2384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 671 ms.
Support contains 21 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 353/353 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 157 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 157 transition count 337
Applied a total of 4 rules in 24 ms. Remains 157 /159 variables (removed 2) and now considering 337/353 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 157/159 places, 337/353 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1037 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 399217 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399217 steps, saw 175783 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 337 rows 157 cols
[2023-03-20 14:05:49] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 14:05:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:05:49] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 14:05:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:05:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 14:05:49] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:49] [INFO ] State equation strengthened by 219 read => feed constraints.
[2023-03-20 14:05:50] [INFO ] After 541ms SMT Verify possible using 219 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:50] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-20 14:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-20 14:05:51] [INFO ] After 1408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 567 ms.
[2023-03-20 14:05:51] [INFO ] After 2335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 496 ms.
Support contains 21 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 337/337 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 337/337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 157/157 places, 337/337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 337/337 transitions.
Applied a total of 0 rules in 13 ms. Remains 157 /157 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2023-03-20 14:05:52] [INFO ] Invariant cache hit.
[2023-03-20 14:05:52] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 14:05:52] [INFO ] Invariant cache hit.
[2023-03-20 14:05:52] [INFO ] State equation strengthened by 219 read => feed constraints.
[2023-03-20 14:05:53] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-20 14:05:53] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-20 14:05:53] [INFO ] Invariant cache hit.
[2023-03-20 14:05:53] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 157/157 places, 337/337 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 157 transition count 332
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 153 transition count 332
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 9 place count 153 transition count 315
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 43 place count 136 transition count 315
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 69 place count 123 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 71 place count 122 transition count 314
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 122 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 122 transition count 312
Applied a total of 75 rules in 37 ms. Remains 122 /157 variables (removed 35) and now considering 312/337 (removed 25) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 312 rows 122 cols
[2023-03-20 14:05:53] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:05:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-20 14:05:53] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 14:05:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:05:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:05:54] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-20 14:05:54] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2023-03-20 14:05:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-20 14:05:54] [INFO ] After 861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-20 14:05:55] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 14:05:55] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 14:05:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 337 transitions and 1336 arcs took 4 ms.
[2023-03-20 14:05:55] [INFO ] Flatten gal took : 81 ms
Total runtime 52635 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/548/inv_0_ --invariant=/tmp/548/inv_1_ --invariant=/tmp/548/inv_2_ --invariant=/tmp/548/inv_3_ --invariant=/tmp/548/inv_4_ --invariant=/tmp/548/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14789844 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097700 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-d2m96"
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-d2m96, 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-167905978300495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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