Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689400478.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689400478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.8K Apr 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 01:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 01:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 30 01:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 266K May 10 09:33 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-12b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654267021527

Running Version 202205111006
[2022-06-03 14:37:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:37:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:37:03] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-06-03 14:37:03] [INFO ] Transformed 1126 places.
[2022-06-03 14:37:03] [INFO ] Transformed 1124 transitions.
[2022-06-03 14:37:03] [INFO ] Found NUPN structural information;
[2022-06-03 14:37:03] [INFO ] Parsed PT model containing 1126 places and 1124 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 18 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 14) seen :4
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2022-06-03 14:37:04] [INFO ] Computed 76 place invariants in 21 ms
[2022-06-03 14:37:05] [INFO ] [Real]Absence check using 75 positive place invariants in 36 ms returned sat
[2022-06-03 14:37:05] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-03 14:37:05] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 14:37:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 51 ms returned sat
[2022-06-03 14:37:05] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-03 14:37:06] [INFO ] After 1218ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2022-06-03 14:37:07] [INFO ] Deduced a trap composed of 67 places in 347 ms of which 7 ms to minimize.
[2022-06-03 14:37:07] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 2 ms to minimize.
[2022-06-03 14:37:08] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 2 ms to minimize.
[2022-06-03 14:37:08] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2022-06-03 14:37:08] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 1 ms to minimize.
[2022-06-03 14:37:09] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 1 ms to minimize.
[2022-06-03 14:37:09] [INFO ] Deduced a trap composed of 95 places in 231 ms of which 1 ms to minimize.
[2022-06-03 14:37:09] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 1 ms to minimize.
[2022-06-03 14:37:09] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 0 ms to minimize.
[2022-06-03 14:37:10] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 1 ms to minimize.
[2022-06-03 14:37:10] [INFO ] Deduced a trap composed of 86 places in 239 ms of which 1 ms to minimize.
[2022-06-03 14:37:10] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 1 ms to minimize.
[2022-06-03 14:37:10] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 0 ms to minimize.
[2022-06-03 14:37:11] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 0 ms to minimize.
[2022-06-03 14:37:11] [INFO ] Deduced a trap composed of 110 places in 225 ms of which 1 ms to minimize.
[2022-06-03 14:37:11] [INFO ] Deduced a trap composed of 123 places in 212 ms of which 1 ms to minimize.
[2022-06-03 14:37:11] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 1 ms to minimize.
[2022-06-03 14:37:12] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 1 ms to minimize.
[2022-06-03 14:37:12] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 1 ms to minimize.
[2022-06-03 14:37:12] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 1 ms to minimize.
[2022-06-03 14:37:12] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5767 ms
[2022-06-03 14:37:13] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2022-06-03 14:37:13] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 0 ms to minimize.
[2022-06-03 14:37:13] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 0 ms to minimize.
[2022-06-03 14:37:14] [INFO ] Deduced a trap composed of 163 places in 254 ms of which 1 ms to minimize.
[2022-06-03 14:37:14] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 1 ms to minimize.
[2022-06-03 14:37:14] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 1 ms to minimize.
[2022-06-03 14:37:15] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2022-06-03 14:37:15] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 1 ms to minimize.
[2022-06-03 14:37:15] [INFO ] Deduced a trap composed of 70 places in 260 ms of which 1 ms to minimize.
[2022-06-03 14:37:16] [INFO ] Deduced a trap composed of 134 places in 255 ms of which 1 ms to minimize.
[2022-06-03 14:37:16] [INFO ] Deduced a trap composed of 95 places in 254 ms of which 1 ms to minimize.
[2022-06-03 14:37:16] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 1 ms to minimize.
[2022-06-03 14:37:17] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 0 ms to minimize.
[2022-06-03 14:37:17] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 1 ms to minimize.
[2022-06-03 14:37:17] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 2 ms to minimize.
[2022-06-03 14:37:18] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 0 ms to minimize.
[2022-06-03 14:37:18] [INFO ] Deduced a trap composed of 142 places in 244 ms of which 0 ms to minimize.
[2022-06-03 14:37:18] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 1 ms to minimize.
[2022-06-03 14:37:18] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 1 ms to minimize.
[2022-06-03 14:37:19] [INFO ] Deduced a trap composed of 126 places in 181 ms of which 2 ms to minimize.
[2022-06-03 14:37:19] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 1 ms to minimize.
[2022-06-03 14:37:19] [INFO ] Deduced a trap composed of 134 places in 191 ms of which 0 ms to minimize.
[2022-06-03 14:37:19] [INFO ] Deduced a trap composed of 132 places in 208 ms of which 1 ms to minimize.
[2022-06-03 14:37:20] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 0 ms to minimize.
[2022-06-03 14:37:20] [INFO ] Deduced a trap composed of 190 places in 193 ms of which 1 ms to minimize.
[2022-06-03 14:37:20] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 0 ms to minimize.
[2022-06-03 14:37:20] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 1 ms to minimize.
[2022-06-03 14:37:20] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 0 ms to minimize.
[2022-06-03 14:37:21] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 0 ms to minimize.
[2022-06-03 14:37:21] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 1 ms to minimize.
[2022-06-03 14:37:21] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8669 ms
[2022-06-03 14:37:22] [INFO ] Deduced a trap composed of 81 places in 267 ms of which 1 ms to minimize.
[2022-06-03 14:37:22] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 1 ms to minimize.
[2022-06-03 14:37:22] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 0 ms to minimize.
[2022-06-03 14:37:22] [INFO ] Deduced a trap composed of 117 places in 188 ms of which 0 ms to minimize.
[2022-06-03 14:37:23] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 1 ms to minimize.
[2022-06-03 14:37:23] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 2 ms to minimize.
[2022-06-03 14:37:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1761 ms
[2022-06-03 14:37:23] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 2 ms to minimize.
[2022-06-03 14:37:24] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 1 ms to minimize.
[2022-06-03 14:37:24] [INFO ] Deduced a trap composed of 118 places in 215 ms of which 1 ms to minimize.
[2022-06-03 14:37:24] [INFO ] Deduced a trap composed of 184 places in 186 ms of which 1 ms to minimize.
[2022-06-03 14:37:24] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 1 ms to minimize.
[2022-06-03 14:37:25] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 7 ms to minimize.
[2022-06-03 14:37:25] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2022-06-03 14:37:25] [INFO ] Deduced a trap composed of 172 places in 247 ms of which 1 ms to minimize.
[2022-06-03 14:37:25] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 1 ms to minimize.
[2022-06-03 14:37:26] [INFO ] Deduced a trap composed of 160 places in 221 ms of which 5 ms to minimize.
[2022-06-03 14:37:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2675 ms
[2022-06-03 14:37:26] [INFO ] After 20761ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 588 ms.
[2022-06-03 14:37:26] [INFO ] After 21811ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6101 ms.
Support contains 52 out of 1126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1126 transition count 734
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 456 rules applied. Total rules applied 846 place count 736 transition count 668
Reduce places removed 20 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 40 rules applied. Total rules applied 886 place count 716 transition count 648
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 911 place count 696 transition count 643
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 142 Pre rules applied. Total rules applied 911 place count 696 transition count 501
Deduced a syphon composed of 142 places in 3 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 1195 place count 554 transition count 501
Discarding 94 places :
Symmetric choice reduction at 4 with 94 rule applications. Total rules 1289 place count 460 transition count 407
Iterating global reduction 4 with 94 rules applied. Total rules applied 1383 place count 460 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1385 place count 460 transition count 405
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1385 place count 460 transition count 376
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1443 place count 431 transition count 376
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 1635 place count 335 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1637 place count 334 transition count 280
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1642 place count 334 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1644 place count 333 transition count 274
Free-agglomeration rule applied 40 times.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1684 place count 333 transition count 234
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1724 place count 293 transition count 234
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1725 place count 293 transition count 233
Applied a total of 1725 rules in 198 ms. Remains 293 /1126 variables (removed 833) and now considering 233/1124 (removed 891) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/1126 places, 233/1124 transitions.
Incomplete random walk after 1000000 steps, including 15292 resets, run finished after 21166 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1859 resets, run finished after 3276 ms. (steps per millisecond=305 ) properties (out of 4) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1922 resets, run finished after 3202 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1876 resets, run finished after 2511 ms. (steps per millisecond=398 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1984 resets, run finished after 1809 ms. (steps per millisecond=552 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 233 rows 293 cols
[2022-06-03 14:38:05] [INFO ] Computed 76 place invariants in 3 ms
[2022-06-03 14:38:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:38:05] [INFO ] [Nat]Absence check using 74 positive place invariants in 10 ms returned sat
[2022-06-03 14:38:05] [INFO ] [Nat]Absence check using 74 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-03 14:38:05] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:38:05] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-03 14:38:05] [INFO ] After 45ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:38:05] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2022-06-03 14:38:05] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2022-06-03 14:38:05] [INFO ] Deduced a trap composed of 95 places in 47 ms of which 1 ms to minimize.
[2022-06-03 14:38:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-06-03 14:38:05] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 0 ms to minimize.
[2022-06-03 14:38:06] [INFO ] Deduced a trap composed of 115 places in 55 ms of which 0 ms to minimize.
[2022-06-03 14:38:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 445 ms
[2022-06-03 14:38:06] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-06-03 14:38:06] [INFO ] After 792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 389 ms.
Support contains 28 out of 293 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 293/293 places, 233/233 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 293 transition count 222
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 282 transition count 222
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 22 place count 282 transition count 214
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 274 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 272 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 272 transition count 212
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 60 place count 263 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 263 transition count 201
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 263 transition count 195
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 73 place count 257 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 256 transition count 194
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 81 place count 250 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 249 transition count 193
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 82 place count 249 transition count 189
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 90 place count 245 transition count 189
Applied a total of 90 rules in 83 ms. Remains 245 /293 variables (removed 48) and now considering 189/233 (removed 44) transitions.
Finished structural reductions, in 1 iterations. Remains : 245/293 places, 189/233 transitions.
Finished random walk after 236903 steps, including 4487 resets, run visited all 2 properties in 1758 ms. (steps per millisecond=134 )
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 65512 ms.

BK_STOP 1654267088442

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-12b"
export BK_EXAMINATION="ReachabilityCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689400478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;