About the Execution of Marcie+red for AutoFlight-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6337.144 | 3600000.00 | 3668100.00 | 82.30 | TTFFTTTTFTFTTTTT | 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.r010-oct2-167813599000415.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000415
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 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.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 70K 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 AutoFlight-PT-03b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678688310369
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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:18:33] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-13 06:18:33] [INFO ] Transformed 298 places.
[2023-03-13 06:18:33] [INFO ] Transformed 296 transitions.
[2023-03-13 06:18:33] [INFO ] Found NUPN structural information;
[2023-03-13 06:18:33] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 63 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-03b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 296 rows 298 cols
[2023-03-13 06:18:34] [INFO ] Computed 22 place invariants in 9 ms
[2023-03-13 06:18:34] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-13 06:18:34] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 06:18:34] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 06:18:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-13 06:18:35] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:18:35] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 06:18:35] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 6 ms to minimize.
[2023-03-13 06:18:35] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2023-03-13 06:18:35] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2023-03-13 06:18:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2023-03-13 06:18:35] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2023-03-13 06:18:35] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 14 ms to minimize.
[2023-03-13 06:18:36] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 1 ms to minimize.
[2023-03-13 06:18:36] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 1 ms to minimize.
[2023-03-13 06:18:36] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 6 ms to minimize.
[2023-03-13 06:18:36] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-03-13 06:18:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1155 ms
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 1 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2023-03-13 06:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2023-03-13 06:18:37] [INFO ] After 2840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-13 06:18:38] [INFO ] After 3359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutoFlight-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 37 ms.
Support contains 77 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 298 transition count 245
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 112 place count 247 transition count 235
Reduce places removed 2 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 22 rules applied. Total rules applied 134 place count 245 transition count 215
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 157 place count 225 transition count 212
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 157 place count 225 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 203 place count 202 transition count 189
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 220 place count 185 transition count 172
Iterating global reduction 4 with 17 rules applied. Total rules applied 237 place count 185 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 237 place count 185 transition count 169
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 243 place count 182 transition count 169
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 275 place count 166 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 166 transition count 152
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 282 place count 166 transition count 146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 288 place count 160 transition count 146
Applied a total of 288 rules in 63 ms. Remains 160 /298 variables (removed 138) and now considering 146/296 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 160/298 places, 146/296 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 661087 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661087 steps, saw 108081 distinct states, run finished after 3007 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 160 cols
[2023-03-13 06:18:41] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-13 06:18:41] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 06:18:41] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 06:18:41] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-13 06:18:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:18:41] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-13 06:18:42] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-13 06:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-13 06:18:42] [INFO ] After 239ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 06:18:42] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 06:18:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 06:18:42] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-13 06:18:42] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 06:18:42] [INFO ] After 270ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 06:18:43] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 1 ms to minimize.
[2023-03-13 06:18:43] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-13 06:18:43] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-13 06:18:44] [INFO ] Deduced a trap composed of 21 places in 1075 ms of which 0 ms to minimize.
[2023-03-13 06:18:44] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2023-03-13 06:18:44] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2023-03-13 06:18:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1821 ms
[2023-03-13 06:18:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-13 06:18:44] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 452 ms
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2023-03-13 06:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-13 06:18:45] [INFO ] After 3106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-13 06:18:45] [INFO ] After 3739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA AutoFlight-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 74 ms.
Support contains 45 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 146/146 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 138
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 152 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 148 transition count 134
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 24 place count 148 transition count 129
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 34 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 142 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 142 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 142 transition count 127
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 4 with 28 rules applied. Total rules applied 65 place count 128 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 67 place count 127 transition count 113
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 127 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 124 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 123 transition count 109
Applied a total of 74 rules in 51 ms. Remains 123 /160 variables (removed 37) and now considering 109/146 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 123/160 places, 109/146 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 109 rows 123 cols
[2023-03-13 06:18:46] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-13 06:18:46] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 06:18:46] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 06:18:46] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 06:18:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-13 06:18:46] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-13 06:18:46] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 06:18:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 06:18:46] [INFO ] After 85ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 06:18:46] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 28 ms to minimize.
[2023-03-13 06:18:47] [INFO ] Deduced a trap composed of 34 places in 540 ms of which 23 ms to minimize.
[2023-03-13 06:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2023-03-13 06:18:47] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-13 06:18:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-13 06:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-13 06:18:47] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-13 06:18:47] [INFO ] After 1181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
Support contains 23 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 109/109 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 99
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 113 transition count 99
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 113 transition count 89
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 102 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 102 transition count 88
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 60 place count 93 transition count 79
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 93 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 91 transition count 77
Applied a total of 64 rules in 29 ms. Remains 91 /123 variables (removed 32) and now considering 77/109 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 91/123 places, 77/109 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 7890 steps, including 31 resets, run visited all 1 properties in 9 ms. (steps per millisecond=876 )
FORMULA AutoFlight-PT-03b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 14716 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: AutoFlight_PT_03b
(NrP: 298 NrTr: 296 NrArc: 692)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.012sec
init dd package: 0m 3.145sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9850320 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101888 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
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="AutoFlight-PT-03b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutoFlight-PT-03b, 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 r010-oct2-167813599000415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b 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 ;