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.r009-oct2-167813597900463.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 ltsminxred
Input is AutoFlight-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 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.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 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 134K 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-06b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678630120124

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=AutoFlight-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:08:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:08:43] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 14:08:43] [INFO ] Transformed 574 places.
[2023-03-12 14:08:43] [INFO ] Transformed 572 transitions.
[2023-03-12 14:08:43] [INFO ] Found NUPN structural information;
[2023-03-12 14:08:43] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-12 14:08:43] [INFO ] Computed 40 place invariants in 16 ms
[2023-03-12 14:08:44] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 14:08:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2023-03-12 14:08:44] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 14:08:45] [INFO ] After 1026ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 14:08:46] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 19 ms to minimize.
[2023-03-12 14:08:46] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-12 14:08:46] [INFO ] Deduced a trap composed of 60 places in 352 ms of which 13 ms to minimize.
[2023-03-12 14:08:46] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 3 ms to minimize.
[2023-03-12 14:08:47] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2023-03-12 14:08:47] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 0 ms to minimize.
[2023-03-12 14:08:47] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2023-03-12 14:08:47] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 1 ms to minimize.
[2023-03-12 14:08:48] [INFO ] Deduced a trap composed of 67 places in 324 ms of which 1 ms to minimize.
[2023-03-12 14:08:48] [INFO ] Deduced a trap composed of 82 places in 209 ms of which 0 ms to minimize.
[2023-03-12 14:08:48] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 1 ms to minimize.
[2023-03-12 14:08:48] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 13 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 1 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 0 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 0 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2023-03-12 14:08:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4120 ms
[2023-03-12 14:08:50] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2023-03-12 14:08:50] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2023-03-12 14:08:50] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2023-03-12 14:08:50] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
[2023-03-12 14:08:51] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 1 ms to minimize.
[2023-03-12 14:08:51] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 1 ms to minimize.
[2023-03-12 14:08:51] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 4 ms to minimize.
[2023-03-12 14:08:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1422 ms
[2023-03-12 14:08:51] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2023-03-12 14:08:52] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 1 ms to minimize.
[2023-03-12 14:08:52] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2023-03-12 14:08:52] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 1 ms to minimize.
[2023-03-12 14:08:52] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2023-03-12 14:08:52] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-12 14:08:53] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 1 ms to minimize.
[2023-03-12 14:08:53] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 0 ms to minimize.
[2023-03-12 14:08:53] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 1 ms to minimize.
[2023-03-12 14:08:53] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 4 ms to minimize.
[2023-03-12 14:08:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2152 ms
[2023-03-12 14:08:53] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-12 14:08:54] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2023-03-12 14:08:54] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 1 ms to minimize.
[2023-03-12 14:08:54] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2023-03-12 14:08:54] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 13 ms to minimize.
[2023-03-12 14:08:54] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 1 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 0 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 1 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1881 ms
[2023-03-12 14:08:55] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2023-03-12 14:08:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 138 ms
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 1 ms to minimize.
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 1 ms to minimize.
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 0 ms to minimize.
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 0 ms to minimize.
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 13 ms to minimize.
[2023-03-12 14:08:56] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 0 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 0 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 15 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2023-03-12 14:08:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1885 ms
[2023-03-12 14:08:57] [INFO ] After 13040ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-12 14:08:58] [INFO ] After 13795ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA AutoFlight-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 48 ms.
Support contains 98 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 574 transition count 429
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 160 rules applied. Total rules applied 303 place count 431 transition count 412
Reduce places removed 5 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 38 rules applied. Total rules applied 341 place count 426 transition count 379
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 39 rules applied. Total rules applied 380 place count 393 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 381 place count 392 transition count 373
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 381 place count 392 transition count 322
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 483 place count 341 transition count 322
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 508 place count 316 transition count 297
Iterating global reduction 5 with 25 rules applied. Total rules applied 533 place count 316 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 535 place count 316 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 535 place count 316 transition count 293
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 539 place count 314 transition count 293
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 665 place count 251 transition count 230
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 6 with 2 rules applied. Total rules applied 667 place count 250 transition count 230
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 677 place count 250 transition count 220
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 685 place count 250 transition count 212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 693 place count 242 transition count 212
Applied a total of 693 rules in 108 ms. Remains 242 /574 variables (removed 332) and now considering 212/572 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 242/574 places, 212/572 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :2
FORMULA AutoFlight-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 212 rows 242 cols
[2023-03-12 14:08:58] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-12 14:08:58] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:08:58] [INFO ] [Nat]Absence check using 38 positive place invariants in 16 ms returned sat
[2023-03-12 14:08:58] [INFO ] [Nat]Absence check using 38 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-12 14:08:58] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:08:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 14:08:58] [INFO ] After 64ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 10 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-12 14:08:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 993 ms
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 14 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 11 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 20 ms to minimize.
[2023-03-12 14:09:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 746 ms
[2023-03-12 14:09:00] [INFO ] After 1938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 14:09:00] [INFO ] After 2251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 59 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 212/212 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 9 rules applied. Total rules applied 9 place count 242 transition count 203
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 22 place count 233 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 229 transition count 199
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 26 place count 229 transition count 192
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 40 place count 222 transition count 192
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 220 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 220 transition count 190
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 86 place count 199 transition count 169
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 199 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 196 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 195 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 193 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 95 place count 193 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 99 place count 191 transition count 163
Applied a total of 99 rules in 36 ms. Remains 191 /242 variables (removed 51) and now considering 163/212 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 191/242 places, 163/212 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 865742 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 865742 steps, saw 130320 distinct states, run finished after 3003 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 163 rows 191 cols
[2023-03-12 14:09:04] [INFO ] Computed 38 place invariants in 14 ms
[2023-03-12 14:09:04] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:09:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2023-03-12 14:09:04] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 14:09:04] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 14:09:04] [INFO ] After 58ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:04] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-12 14:09:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-12 14:09:04] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2023-03-12 14:09:04] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-03-12 14:09:04] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-12 14:09:04] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2023-03-12 14:09:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-12 14:09:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 483 ms
[2023-03-12 14:09:05] [INFO ] After 725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 14:09:05] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 59 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 163/163 transitions.
Applied a total of 0 rules in 11 ms. Remains 191 /191 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 191/191 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 163/163 transitions.
Applied a total of 0 rules in 11 ms. Remains 191 /191 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-12 14:09:05] [INFO ] Invariant cache hit.
[2023-03-12 14:09:05] [INFO ] Implicit Places using invariants in 203 ms returned [174, 187]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 207 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/191 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 225 ms. Remains : 189/191 places, 163/163 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 932191 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 932191 steps, saw 139098 distinct states, run finished after 3004 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 163 rows 189 cols
[2023-03-12 14:09:08] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-12 14:09:08] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:09:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-12 14:09:08] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 14:09:09] [INFO ] After 110ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2023-03-12 14:09:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 470 ms
[2023-03-12 14:09:09] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 14:09:09] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 59 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 189/189 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-12 14:09:09] [INFO ] Invariant cache hit.
[2023-03-12 14:09:09] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 14:09:09] [INFO ] Invariant cache hit.
[2023-03-12 14:09:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 14:09:10] [INFO ] Implicit Places using invariants and state equation in 291 ms returned [26, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 440 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 187/189 places, 163/163 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 187 transition count 158
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 182 transition count 158
Applied a total of 10 rules in 6 ms. Remains 182 /187 variables (removed 5) and now considering 158/163 (removed 5) transitions.
// Phase 1: matrix 158 rows 182 cols
[2023-03-12 14:09:10] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-12 14:09:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 14:09:10] [INFO ] Invariant cache hit.
[2023-03-12 14:09:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 14:09:10] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 182/189 places, 158/163 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 759 ms. Remains : 182/189 places, 158/163 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1122603 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1122603 steps, saw 166167 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:09:13] [INFO ] Invariant cache hit.
[2023-03-12 14:09:13] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:09:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-12 14:09:13] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 14:09:13] [INFO ] After 73ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:14] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-12 14:09:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-12 14:09:14] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 0 ms to minimize.
[2023-03-12 14:09:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-12 14:09:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-12 14:09:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
[2023-03-12 14:09:14] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 14:09:14] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 59 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 158/158 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 182/182 places, 158/158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-12 14:09:14] [INFO ] Invariant cache hit.
[2023-03-12 14:09:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-12 14:09:14] [INFO ] Invariant cache hit.
[2023-03-12 14:09:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 14:09:14] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-12 14:09:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 14:09:14] [INFO ] Invariant cache hit.
[2023-03-12 14:09:14] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 182/182 places, 158/158 transitions.
Graph (complete) has 324 edges and 182 vertex of which 175 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output 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 2 place count 175 transition count 157
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 4 place count 174 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 173 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 5 place count 173 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 29 place count 161 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 161 transition count 144
Applied a total of 30 rules in 13 ms. Remains 161 /182 variables (removed 21) and now considering 144/158 (removed 14) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 144 rows 161 cols
[2023-03-12 14:09:14] [INFO ] Computed 27 place invariants in 14 ms
[2023-03-12 14:09:14] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:09:15] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-12 14:09:15] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2023-03-12 14:09:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2023-03-12 14:09:15] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 14:09:15] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:09:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 14:09:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 158 transitions and 501 arcs took 3 ms.
[2023-03-12 14:09:16] [INFO ] Flatten gal took : 41 ms
Total runtime 33424 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/843/inv_0_ --invariant=/tmp/843/inv_1_ --inv-par
FORMULA AutoFlight-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678631343904

--------------------
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 AutoFlight-PT-06b-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/843/inv_0_
rfs formula name AutoFlight-PT-06b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/843/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 182 places, 158 transitions and 501 arcs
pnml2lts-sym: Petri net AutoFlight_PT_06b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 158->149 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 182; there are 149 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
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/843/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/843/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 1186.540 real 4741.430 user 0.730 sys
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="AutoFlight-PT-06b"
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 AutoFlight-PT-06b, 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 r009-oct2-167813597900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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