Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167100174.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-24a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 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-24a-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-24a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716286164284

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 10:09:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 10:09:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:09:26] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2024-05-21 10:09:26] [INFO ] Transformed 607 places.
[2024-05-21 10:09:26] [INFO ] Transformed 605 transitions.
[2024-05-21 10:09:26] [INFO ] Found NUPN structural information;
[2024-05-21 10:09:26] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:09:27] [INFO ] Flatten gal took : 375 ms
RANDOM walk for 40000 steps (452 resets) in 3540 ms. (11 steps per ms) remains 6/14 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 10:09:27] [INFO ] Flatten gal took : 189 ms
BEST_FIRST walk for 40003 steps (12 resets) in 570 ms. (70 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 10:09:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10918237961107025991.gal : 79 ms
BEST_FIRST walk for 40004 steps (12 resets) in 447 ms. (89 steps per ms) remains 5/5 properties
[2024-05-21 10:09:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16403938312546444276.prop : 3 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10918237961107025991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16403938312546444276.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (12 resets) in 443 ms. (90 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality16403938312546444276.prop.
BEST_FIRST walk for 40004 steps (12 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 363 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 398 ms. (100 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 9
// Phase 1: matrix 485 rows 607 cols
[2024-05-21 10:09:28] [INFO ] Computed 148 invariants in 37 ms
[2024-05-21 10:09:28] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :9 after 257
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 230/323 variables, 57/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 230/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 179/502 variables, 90/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 179/649 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 105/607 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 105/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 485/1092 variables, 607/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1092 variables, 120/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1092 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 1482 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1850 ms.
Refiners :[Domain max(s): 607/607 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 230/323 variables, 57/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 230/380 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 179/502 variables, 90/470 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 179/649 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/649 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 105/607 variables, 1/650 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 105/755 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 10:09:31] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 46 ms to minimize.
[2024-05-21 10:09:31] [INFO ] Deduced a trap composed of 249 places in 266 ms of which 5 ms to minimize.
[2024-05-21 10:09:32] [INFO ] Deduced a trap composed of 251 places in 227 ms of which 4 ms to minimize.
[2024-05-21 10:09:32] [INFO ] Deduced a trap composed of 254 places in 225 ms of which 4 ms to minimize.
[2024-05-21 10:09:32] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 4 ms to minimize.
[2024-05-21 10:09:32] [INFO ] Deduced a trap composed of 267 places in 191 ms of which 5 ms to minimize.
[2024-05-21 10:09:33] [INFO ] Deduced a trap composed of 252 places in 186 ms of which 4 ms to minimize.
[2024-05-21 10:09:33] [INFO ] Deduced a trap composed of 258 places in 181 ms of which 4 ms to minimize.
[2024-05-21 10:09:33] [INFO ] Deduced a trap composed of 266 places in 190 ms of which 4 ms to minimize.
[2024-05-21 10:09:33] [INFO ] Deduced a trap composed of 262 places in 222 ms of which 4 ms to minimize.
[2024-05-21 10:09:33] [INFO ] Deduced a trap composed of 259 places in 214 ms of which 4 ms to minimize.
[2024-05-21 10:09:34] [INFO ] Deduced a trap composed of 263 places in 189 ms of which 4 ms to minimize.
[2024-05-21 10:09:34] [INFO ] Deduced a trap composed of 265 places in 181 ms of which 4 ms to minimize.
[2024-05-21 10:09:34] [INFO ] Deduced a trap composed of 269 places in 201 ms of which 3 ms to minimize.
Problem AutoFlight-PT-24a-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 14/769 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/769 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 485/1092 variables, 607/1376 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1092 variables, 120/1496 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1092 variables, 2/1498 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 10:09:35] [INFO ] Deduced a trap composed of 256 places in 151 ms of which 3 ms to minimize.
[2024-05-21 10:09:35] [INFO ] Deduced a trap composed of 268 places in 175 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1092 variables, 2/1500 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1092 variables, 0/1500 constraints. Problems are: Problem set: 3 solved, 2 unsolved
(s221 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 1)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 1)
(s187 1)
(s188 0)
(s189 1)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 1)
(s196 1)
(s197 0)
(s198 1)
(s199 1)
(s200 0)
(s201 1)
(s202 1)
(s203 0)
(s204 1)
(s205 1)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 1)
(s211 1)
(s212 0)
(s213 1)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 1)
(s220 1)
(s221 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1500 constraints, problems are : Problem set: 3 solved, 2 unsolved in 5013 ms.
Refiners :[Domain max(s): 607/607 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 7058ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 485/485 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 607 transition count 415
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 537 transition count 415
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 140 place count 537 transition count 393
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 184 place count 515 transition count 393
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 272 place count 471 transition count 349
Free-agglomeration rule applied 41 times.
Iterating global reduction 2 with 41 rules applied. Total rules applied 313 place count 471 transition count 308
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 354 place count 430 transition count 308
Applied a total of 354 rules in 232 ms. Remains 430 /607 variables (removed 177) and now considering 308/485 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 430/607 places, 308/485 transitions.
RANDOM walk for 40000 steps (630 resets) in 874 ms. (45 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 24223 steps (60 resets) in 172 ms. (140 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-24a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 10270 ms.

BK_STOP 1716286176381

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-24a"
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-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-24a, 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 r026-smll-171620167100174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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