About the Execution of LTSMin+red for DES-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
349.903 | 25078.00 | 65528.00 | 356.20 | FTTTTFFFTTTTFTTT | normal |
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.r105-tall-167814481100391.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 DES-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100391
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-02b-ReachabilityFireability-00
FORMULA_NAME DES-PT-02b-ReachabilityFireability-01
FORMULA_NAME DES-PT-02b-ReachabilityFireability-02
FORMULA_NAME DES-PT-02b-ReachabilityFireability-03
FORMULA_NAME DES-PT-02b-ReachabilityFireability-04
FORMULA_NAME DES-PT-02b-ReachabilityFireability-05
FORMULA_NAME DES-PT-02b-ReachabilityFireability-06
FORMULA_NAME DES-PT-02b-ReachabilityFireability-07
FORMULA_NAME DES-PT-02b-ReachabilityFireability-08
FORMULA_NAME DES-PT-02b-ReachabilityFireability-09
FORMULA_NAME DES-PT-02b-ReachabilityFireability-10
FORMULA_NAME DES-PT-02b-ReachabilityFireability-11
FORMULA_NAME DES-PT-02b-ReachabilityFireability-12
FORMULA_NAME DES-PT-02b-ReachabilityFireability-13
FORMULA_NAME DES-PT-02b-ReachabilityFireability-14
FORMULA_NAME DES-PT-02b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678288607911
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=DES-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 15:16:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 15:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 15:16:49] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 15:16:49] [INFO ] Transformed 288 places.
[2023-03-08 15:16:49] [INFO ] Transformed 239 transitions.
[2023-03-08 15:16:49] [INFO ] Found NUPN structural information;
[2023-03-08 15:16:49] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 85 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 16) seen :11
FORMULA DES-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-02b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 239 rows 288 cols
[2023-03-08 15:16:50] [INFO ] Computed 65 place invariants in 17 ms
[2023-03-08 15:16:50] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 15:16:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 15:16:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-08 15:16:51] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 15:16:51] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
[2023-03-08 15:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-08 15:16:51] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2023-03-08 15:16:51] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2023-03-08 15:16:51] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-08 15:16:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2023-03-08 15:16:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2023-03-08 15:16:52] [INFO ] After 946ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-08 15:16:52] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA DES-PT-02b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 72 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 239/239 transitions.
Graph (complete) has 525 edges and 288 vertex of which 277 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 277 transition count 224
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 268 transition count 221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 265 transition count 221
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 265 transition count 216
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 260 transition count 216
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 49 place count 247 transition count 203
Iterating global reduction 3 with 13 rules applied. Total rules applied 62 place count 247 transition count 203
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 71 place count 238 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 80 place count 238 transition count 194
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 88 place count 238 transition count 186
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 172 place count 196 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 196 transition count 143
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 177 place count 196 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 181 place count 192 transition count 139
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 184 place count 192 transition count 139
Applied a total of 184 rules in 96 ms. Remains 192 /288 variables (removed 96) and now considering 139/239 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 192/288 places, 139/239 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :1
FORMULA DES-PT-02b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 139 rows 192 cols
[2023-03-08 15:16:52] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-08 15:16:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 15:16:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 15:16:52] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-08 15:16:52] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 15:16:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 15:16:52] [INFO ] After 68ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 15:16:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-08 15:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 15:16:53] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-08 15:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 15:16:53] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-08 15:16:53] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 41 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 139/139 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 192 transition count 138
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 191 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 190 transition count 137
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 190 transition count 133
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 186 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 185 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 185 transition count 132
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 34 place count 175 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 175 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 174 transition count 121
Applied a total of 36 rules in 27 ms. Remains 174 /192 variables (removed 18) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 174/192 places, 121/139 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 918921 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 918921 steps, saw 144574 distinct states, run finished after 3002 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 174 cols
[2023-03-08 15:16:56] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 15:16:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 15:16:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 15:16:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 15:16:56] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 15:16:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 15:16:56] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 15:16:56] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-08 15:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 15:16:56] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 15:16:56] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 41 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 174/174 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-08 15:16:56] [INFO ] Invariant cache hit.
[2023-03-08 15:16:56] [INFO ] Implicit Places using invariants in 90 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 173/174 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 109 ms. Remains : 173/174 places, 121/121 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1087622 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1087622 steps, saw 167013 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 173 cols
[2023-03-08 15:17:00] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 15:17:00] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 15:17:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 15:17:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-08 15:17:00] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 15:17:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 15:17:00] [INFO ] After 63ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 15:17:00] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-08 15:17:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-08 15:17:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-08 15:17:00] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 15:17:00] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 41 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 173/173 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-08 15:17:00] [INFO ] Invariant cache hit.
[2023-03-08 15:17:00] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 15:17:00] [INFO ] Invariant cache hit.
[2023-03-08 15:17:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 15:17:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-08 15:17:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 15:17:01] [INFO ] Invariant cache hit.
[2023-03-08 15:17:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 173/173 places, 121/121 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 121
Applied a total of 1 rules in 8 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 173 cols
[2023-03-08 15:17:01] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 15:17:01] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 15:17:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 15:17:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-08 15:17:01] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 15:17:01] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 15:17:01] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-08 15:17:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-08 15:17:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 121 transitions and 451 arcs took 1 ms.
[2023-03-08 15:17:01] [INFO ] Flatten gal took : 39 ms
Total runtime 12360 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/536/inv_0_ --invariant=/tmp/536/inv_1_ --inv-par
FORMULA DES-PT-02b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-02b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678288632989
--------------------
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
rfs formula name DES-PT-02b-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/536/inv_0_
rfs formula name DES-PT-02b-ReachabilityFireability-06
rfs formula type EF
rfs formula formula --invariant=/tmp/536/inv_1_
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 173 places, 121 transitions and 451 arcs
pnml2lts-sym: Petri net DES_PT_02b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 121->116 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 173; there are 116 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:
pnml2lts-sym: Invariant violation (/tmp/536/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 114796 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.930 real 7.320 user 0.390 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.120 user 0.000 sys
pnml2lts-sym: state space has 3880264718805 states, 58009 nodes
pnml2lts-sym: group_next: 1051 nodes total
pnml2lts-sym: group_explored: 1199 nodes, 1865 short vectors total
pnml2lts-sym: max token count: 1
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="DES-PT-02b"
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 DES-PT-02b, 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 r105-tall-167814481100391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-02b.tgz
mv DES-PT-02b 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 '
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 ;