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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 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.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 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 91K 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-04b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678513214230

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-11 05:40:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:40:16] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 05:40:16] [INFO ] Transformed 390 places.
[2023-03-11 05:40:16] [INFO ] Transformed 388 transitions.
[2023-03-11 05:40:16] [INFO ] Found NUPN structural information;
[2023-03-11 05:40:16] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 05:40:17] [INFO ] Flatten gal took : 91 ms
[2023-03-11 05:40:17] [INFO ] Flatten gal took : 26 ms
[2023-03-11 05:40:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13026363548330158087.gal : 13 ms
[2023-03-11 05:40:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18063619198953939995.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13026363548330158087.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18063619198953939995.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 49 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Loading property file /tmp/ReachabilityCardinality18063619198953939995.prop.
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 8
Reachability property AutoFlight-PT-04b-ReachabilityFireability-10 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :8 after 17
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :17 after 26
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :26 after 36
Invariant property AutoFlight-PT-04b-ReachabilityFireability-09 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :36 after 471
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :471 after 22125
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :22125 after 9.74926e+06
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 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 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-11 05:40:17] [INFO ] Computed 28 place invariants in 14 ms
[2023-03-11 05:40:18] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 05:40:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-11 05:40:18] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:40:18] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 05:40:18] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 4 ms to minimize.
[2023-03-11 05:40:18] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-11 05:40:18] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-03-11 05:40:19] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 13 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 1 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 0 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 0 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 0 ms to minimize.
[2023-03-11 05:40:20] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2698 ms
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 0 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2023-03-11 05:40:21] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 716 ms
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 381 ms
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-11 05:40:22] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2023-03-11 05:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-11 05:40:23] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-03-11 05:40:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2023-03-11 05:40:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-11 05:40:23] [INFO ] After 4960ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-11 05:40:23] [INFO ] After 5492ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
Support contains 110 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 390 transition count 322
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 70 rules applied. Total rules applied 136 place count 324 transition count 318
Reduce places removed 2 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 28 rules applied. Total rules applied 164 place count 322 transition count 292
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 197 place count 296 transition count 285
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 197 place count 296 transition count 256
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 255 place count 267 transition count 256
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 278 place count 244 transition count 233
Iterating global reduction 4 with 23 rules applied. Total rules applied 301 place count 244 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 304 place count 244 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 304 place count 244 transition count 226
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 312 place count 240 transition count 226
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 372 place count 210 transition count 196
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 378 place count 210 transition count 190
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 381 place count 210 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 384 place count 207 transition count 187
Applied a total of 384 rules in 92 ms. Remains 207 /390 variables (removed 183) and now considering 187/388 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 207/390 places, 187/388 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 187 rows 207 cols
[2023-03-11 05:40:23] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 05:40:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:40:24] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-11 05:40:24] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 05:40:24] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:40:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 05:40:24] [INFO ] After 152ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:40:24] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2023-03-11 05:40:24] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-11 05:40:24] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 0 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 674 ms
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 6 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 0 ms to minimize.
[2023-03-11 05:40:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2023-03-11 05:40:25] [INFO ] After 1600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-11 05:40:26] [INFO ] After 2066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 96 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 187/187 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 207 transition count 183
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 203 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 202 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 202 transition count 180
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 200 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 199 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 199 transition count 179
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 24 place count 195 transition count 175
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 195 transition count 171
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 32 place count 191 transition count 171
Applied a total of 32 rules in 52 ms. Remains 191 /207 variables (removed 16) and now considering 171/187 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 191/207 places, 171/187 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 171 rows 191 cols
[2023-03-11 05:40:26] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 05:40:26] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:40:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-11 05:40:26] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-11 05:40:26] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:40:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 05:40:26] [INFO ] After 131ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:40:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 9 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2023-03-11 05:40:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 524 ms
[2023-03-11 05:40:27] [INFO ] After 1011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-11 05:40:27] [INFO ] After 1323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
Support contains 79 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 171/171 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 191 transition count 170
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 190 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 188 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 188 transition count 165
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 185 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 184 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 184 transition count 164
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 28 place count 177 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 177 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 175 transition count 155
Applied a total of 32 rules in 21 ms. Remains 175 /191 variables (removed 16) and now considering 155/171 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 175/191 places, 155/171 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1483433 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :{1=1}
Probabilistic random walk after 1483433 steps, saw 211896 distinct states, run finished after 3003 ms. (steps per millisecond=493 ) properties seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 175 cols
[2023-03-11 05:40:30] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-11 05:40:31] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:40:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-11 05:40:31] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-11 05:40:31] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:40:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 05:40:31] [INFO ] After 69ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:40:31] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2023-03-11 05:40:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-11 05:40:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-11 05:40:31] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-11 05:40:31] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 78 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 155/155 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 154
Applied a total of 2 rules in 13 ms. Remains 174 /175 variables (removed 1) and now considering 154/155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 174/175 places, 154/155 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1916044 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1916044 steps, saw 263798 distinct states, run finished after 3003 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 174 cols
[2023-03-11 05:40:34] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-11 05:40:34] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:40:35] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-11 05:40:35] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-11 05:40:35] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:40:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 05:40:35] [INFO ] After 122ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:40:35] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-11 05:40:35] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-11 05:40:35] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-11 05:40:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2023-03-11 05:40:35] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-11 05:40:35] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
FORMULA AutoFlight-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 19455 ms.

BK_STOP 1678513236470

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-04b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-04b, 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 r005-oct2-167813593100431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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