fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689300462
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutoFlight-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
375.539 21798.00 35804.00 54.50 FFTTTFTTTTTTTTFT normal

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-165245689300462.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 01:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 01:40 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 23K 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 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 30 01:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 01:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 30 01:41 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 134K 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-06b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654266984766

Running Version 202205111006
[2022-06-03 14:36:26] [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:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:36:26] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2022-06-03 14:36:26] [INFO ] Transformed 574 places.
[2022-06-03 14:36:26] [INFO ] Transformed 572 transitions.
[2022-06-03 14:36:26] [INFO ] Found NUPN structural information;
[2022-06-03 14:36:26] [INFO ] Parsed PT model containing 574 places and 572 transitions in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 16) seen :6
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 572 rows 574 cols
[2022-06-03 14:36:27] [INFO ] Computed 40 place invariants in 22 ms
[2022-06-03 14:36:28] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 14:36:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-06-03 14:36:28] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-03 14:36:28] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-03 14:36:28] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 6 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 1 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 0 ms to minimize.
[2022-06-03 14:36:29] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 0 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 1 ms to minimize.
[2022-06-03 14:36:30] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 0 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:36:31] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 0 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 0 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 1 ms to minimize.
[2022-06-03 14:36:32] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 0 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 0 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
[2022-06-03 14:36:33] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 1 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 1 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 1 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 0 ms to minimize.
[2022-06-03 14:36:34] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6478 ms
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2022-06-03 14:36:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 750 ms
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 0 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2022-06-03 14:36:36] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2022-06-03 14:36:37] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 0 ms to minimize.
[2022-06-03 14:36:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 733 ms
[2022-06-03 14:36:37] [INFO ] After 8852ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 218 ms.
[2022-06-03 14:36:37] [INFO ] After 9319ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 1794 ms.
Support contains 46 out of 574 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 574 transition count 390
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 212 rules applied. Total rules applied 394 place count 392 transition count 360
Reduce places removed 7 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 19 rules applied. Total rules applied 413 place count 385 transition count 348
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 427 place count 373 transition count 346
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 427 place count 373 transition count 278
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 563 place count 305 transition count 278
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 611 place count 257 transition count 230
Iterating global reduction 4 with 48 rules applied. Total rules applied 659 place count 257 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 662 place count 257 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 663 place count 256 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 663 place count 256 transition count 215
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 687 place count 244 transition count 215
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 779 place count 198 transition count 169
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 782 place count 198 transition count 166
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 802 place count 198 transition count 146
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 822 place count 178 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 823 place count 177 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 827 place count 173 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 827 place count 173 transition count 141
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 835 place count 169 transition count 141
Applied a total of 835 rules in 141 ms. Remains 169 /574 variables (removed 405) and now considering 141/572 (removed 431) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/574 places, 141/572 transitions.
Incomplete random walk after 1000000 steps, including 15362 resets, run finished after 2065 ms. (steps per millisecond=484 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2313 resets, run finished after 1293 ms. (steps per millisecond=773 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 169 cols
[2022-06-03 14:36:42] [INFO ] Computed 36 place invariants in 3 ms
[2022-06-03 14:36:42] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:36:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2022-06-03 14:36:42] [INFO ] [Nat]Absence check using 34 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-03 14:36:42] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:36:42] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-03 14:36:42] [INFO ] After 39ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:36:43] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-06-03 14:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-06-03 14:36:43] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-03 14:36:43] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 26 out of 169 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 169/169 places, 141/141 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 169 transition count 133
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 161 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 161 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 158 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 157 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 157 transition count 129
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 151 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 151 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 149 transition count 121
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 149 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 147 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 147 transition count 119
Applied a total of 46 rules in 62 ms. Remains 147 /169 variables (removed 22) and now considering 119/141 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/169 places, 119/141 transitions.
Incomplete random walk after 1000000 steps, including 12063 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2253 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties (out of 1) seen :0
Finished probabilistic random walk after 51140 steps, run visited all 1 properties in 122 ms. (steps per millisecond=419 )
Probabilistic random walk after 51140 steps, saw 18890 distinct states, run finished after 122 ms. (steps per millisecond=419 ) properties seen :1
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 20388 ms.

BK_STOP 1654267006564

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06b"
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-06b, 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-165245689300462"
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 [ "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 ;