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.r521-tall-167987246400239.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 EisenbergMcGuire-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 460K Mar 31 16:48 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 EisenbergMcGuire-PT-05-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680838145985

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=EisenbergMcGuire-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:29:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:29:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:29:08] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-04-07 03:29:08] [INFO ] Transformed 295 places.
[2023-04-07 03:29:08] [INFO ] Transformed 800 transitions.
[2023-04-07 03:29:08] [INFO ] Found NUPN structural information;
[2023-04-07 03:29:08] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-04-07 03:29:10] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2023-04-07 03:29:10] [INFO ] Computed 16 invariants in 24 ms
[2023-04-07 03:29:11] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 03:29:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-04-07 03:29:11] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 15 ms returned sat
[2023-04-07 03:29:12] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-04-07 03:29:12] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-04-07 03:29:13] [INFO ] After 526ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2023-04-07 03:29:13] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 6 ms to minimize.
[2023-04-07 03:29:13] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2023-04-07 03:29:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 03:29:13] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2023-04-07 03:29:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 465 ms
[2023-04-07 03:29:14] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 1 ms to minimize.
[2023-04-07 03:29:14] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 1 ms to minimize.
[2023-04-07 03:29:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2023-04-07 03:29:14] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2023-04-07 03:29:15] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-04-07 03:29:15] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2023-04-07 03:29:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-07 03:29:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2023-04-07 03:29:15] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-07 03:29:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-07 03:29:15] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2023-04-07 03:29:16] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2023-04-07 03:29:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2023-04-07 03:29:16] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2023-04-07 03:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-07 03:29:16] [INFO ] After 3533ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-04-07 03:29:16] [INFO ] After 5275ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 108 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 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 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 799
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 294 transition count 799
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 2 place count 294 transition count 756
Deduced a syphon composed of 43 places in 6 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 88 place count 251 transition count 756
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 244 transition count 721
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 244 transition count 721
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 130 place count 230 transition count 707
Applied a total of 130 rules in 116 ms. Remains 230 /295 variables (removed 65) and now considering 707/800 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 230/295 places, 707/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 341772 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{0=1, 1=1, 3=1, 6=1, 8=1}
Probabilistic random walk after 341772 steps, saw 141571 distinct states, run finished after 3014 ms. (steps per millisecond=113 ) properties seen :5
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-04-07 03:29:20] [INFO ] Flow matrix only has 372 transitions (discarded 335 similar events)
// Phase 1: matrix 372 rows 230 cols
[2023-04-07 03:29:20] [INFO ] Computed 16 invariants in 7 ms
[2023-04-07 03:29:21] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 03:29:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:29:21] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 7 ms returned sat
[2023-04-07 03:29:21] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-04-07 03:29:21] [INFO ] After 191ms SMT Verify possible using 168 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:21] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 03:29:21] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 894 ms
[2023-04-07 03:29:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 03:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-07 03:29:22] [INFO ] After 1396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-04-07 03:29:23] [INFO ] After 1965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 78 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 707/707 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 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 229 transition count 706
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 229 transition count 695
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 24 place count 218 transition count 695
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 212 transition count 665
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 212 transition count 665
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 663
Applied a total of 40 rules in 64 ms. Remains 210 /230 variables (removed 20) and now considering 663/707 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 210/230 places, 663/707 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 439086 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439086 steps, saw 135671 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 03:29:26] [INFO ] Flow matrix only has 328 transitions (discarded 335 similar events)
// Phase 1: matrix 328 rows 210 cols
[2023-04-07 03:29:26] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 03:29:26] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 03:29:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:29:26] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:29:26] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:26] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-07 03:29:27] [INFO ] After 182ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-04-07 03:29:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2023-04-07 03:29:27] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-04-07 03:29:28] [INFO ] After 1543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 58 ms.
Support contains 78 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 663/663 transitions.
Applied a total of 0 rules in 58 ms. Remains 210 /210 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 210/210 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 663/663 transitions.
Applied a total of 0 rules in 21 ms. Remains 210 /210 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2023-04-07 03:29:28] [INFO ] Flow matrix only has 328 transitions (discarded 335 similar events)
[2023-04-07 03:29:28] [INFO ] Invariant cache hit.
[2023-04-07 03:29:28] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-07 03:29:28] [INFO ] Flow matrix only has 328 transitions (discarded 335 similar events)
[2023-04-07 03:29:28] [INFO ] Invariant cache hit.
[2023-04-07 03:29:28] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-07 03:29:28] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-04-07 03:29:28] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-07 03:29:28] [INFO ] Flow matrix only has 328 transitions (discarded 335 similar events)
[2023-04-07 03:29:28] [INFO ] Invariant cache hit.
[2023-04-07 03:29:29] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 210/210 places, 663/663 transitions.
Graph (trivial) has 231 edges and 210 vertex of which 15 / 210 are part of one of the 5 SCC in 2 ms
Free SCC test removed 10 places
Drop transitions removed 31 transitions
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 373 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 200 transition count 279
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 18 rules applied. Total rules applied 30 place count 189 transition count 272
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 37 place count 182 transition count 272
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 37 place count 182 transition count 267
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 177 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 176 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 176 transition count 266
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 77 place count 162 transition count 252
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 157 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 157 transition count 280
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 116 place count 157 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 156 transition count 260
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 130 place count 156 transition count 248
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 142 place count 144 transition count 248
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 147 place count 144 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 143 transition count 244
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 159 place count 143 transition count 244
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 143 transition count 244
Applied a total of 160 rules in 45 ms. Remains 143 /210 variables (removed 67) and now considering 244/663 (removed 419) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 244 rows 143 cols
[2023-04-07 03:29:29] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:29:29] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 03:29:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 03:29:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 20 ms returned sat
[2023-04-07 03:29:29] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-04-07 03:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-04-07 03:29:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2023-04-07 03:29:30] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-04-07 03:29:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2023-04-07 03:29:30] [INFO ] Deduced a trap composed of 5 places in 625 ms of which 26 ms to minimize.
[2023-04-07 03:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2023-04-07 03:29:30] [INFO ] After 1398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-04-07 03:29:30] [INFO ] After 1723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-04-07 03:29:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-04-07 03:29:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 210 places, 663 transitions and 3196 arcs took 10 ms.
[2023-04-07 03:29:31] [INFO ] Flatten gal took : 151 ms
Total runtime 23104 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/605/inv_0_ --invariant=/tmp/605/inv_1_ --invariant=/tmp/605/inv_2_ --invariant=/tmp/605/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 15361912 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102364 kB
Could not compute solution for formula : EisenbergMcGuire-PT-05-ReachabilityFireability-05
Could not compute solution for formula : EisenbergMcGuire-PT-05-ReachabilityFireability-08
Could not compute solution for formula : EisenbergMcGuire-PT-05-ReachabilityFireability-10
Could not compute solution for formula : EisenbergMcGuire-PT-05-ReachabilityFireability-12

BK_STOP 1680841744083

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name EisenbergMcGuire-PT-05-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/605/inv_0_
rfs formula name EisenbergMcGuire-PT-05-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/605/inv_1_
rfs formula name EisenbergMcGuire-PT-05-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/605/inv_2_
rfs formula name EisenbergMcGuire-PT-05-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/605/inv_3_
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 210 places, 663 transitions and 3196 arcs
pnml2lts-sym: Petri net EisenbergMcGuire_PT_05 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 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: 663->658 groups
pnml2lts-sym: Regrouping took 0.280 real 0.270 user 0.000 sys
pnml2lts-sym: state vector length is 210; there are 658 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: 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) : 611
Killing (9) : 611

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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r521-tall-167987246400239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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