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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 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 113K 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-05b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717187998008

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:40:01] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-31 20:40:01] [INFO ] Transformed 482 places.
[2024-05-31 20:40:01] [INFO ] Transformed 480 transitions.
[2024-05-31 20:40:01] [INFO ] Found NUPN structural information;
[2024-05-31 20:40:01] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (161 resets) in 2657 ms. (15 steps per ms) remains 6/16 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 669 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 691 ms. (57 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 98 ms. (404 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
// Phase 1: matrix 480 rows 482 cols
[2024-05-31 20:40:03] [INFO ] Computed 34 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 385/449 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 385/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/457 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/482 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 25/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1544 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 385/449 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 385/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:40:05] [INFO ] Deduced a trap composed of 34 places in 311 ms of which 56 ms to minimize.
[2024-05-31 20:40:05] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 6 ms to minimize.
[2024-05-31 20:40:05] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 5 ms to minimize.
[2024-05-31 20:40:06] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 6 ms to minimize.
[2024-05-31 20:40:06] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:40:06] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/457 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 25/482 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 25/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 20:40:07] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 7 ms to minimize.
[2024-05-31 20:40:07] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 5 ms to minimize.
[2024-05-31 20:40:07] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 4 ms to minimize.
[2024-05-31 20:40:07] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 5 ms to minimize.
[2024-05-31 20:40:08] [INFO ] Deduced a trap composed of 62 places in 285 ms of which 5 ms to minimize.
[2024-05-31 20:40:08] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 5 ms to minimize.
[2024-05-31 20:40:08] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 5 ms to minimize.
[2024-05-31 20:40:09] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 12 ms to minimize.
[2024-05-31 20:40:09] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 5 ms to minimize.
[2024-05-31 20:40:09] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 4 ms to minimize.
[2024-05-31 20:40:09] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 5 ms to minimize.
SMT process timed out in 6823ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 482 transition count 359
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 138 rules applied. Total rules applied 259 place count 361 transition count 342
Reduce places removed 2 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 21 rules applied. Total rules applied 280 place count 359 transition count 323
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 23 rules applied. Total rules applied 303 place count 340 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 304 place count 339 transition count 319
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 53 Pre rules applied. Total rules applied 304 place count 339 transition count 266
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 410 place count 286 transition count 266
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 442 place count 254 transition count 234
Iterating global reduction 5 with 32 rules applied. Total rules applied 474 place count 254 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 476 place count 254 transition count 232
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 476 place count 254 transition count 223
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 494 place count 245 transition count 223
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 572 place count 206 transition count 184
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 578 place count 203 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 580 place count 203 transition count 183
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 6 with 2 rules applied. Total rules applied 582 place count 202 transition count 182
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 596 place count 202 transition count 168
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 610 place count 188 transition count 168
Applied a total of 610 rules in 272 ms. Remains 188 /482 variables (removed 294) and now considering 168/480 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 188/482 places, 168/480 transitions.
RANDOM walk for 40000 steps (469 resets) in 702 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 372 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (62 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 532 ms. (75 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (62 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
// Phase 1: matrix 168 rows 188 cols
[2024-05-31 20:40:10] [INFO ] Computed 34 invariants in 4 ms
[2024-05-31 20:40:10] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/147 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/169 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/188 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 168/356 variables, 188/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 24/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/356 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 246 constraints, problems are : Problem set: 0 solved, 3 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/147 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/169 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 19/188 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 3 ms to minimize.
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:40:11] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 3 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 168/356 variables, 188/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:40:13] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/356 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2118 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 2534ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 2178 steps, including 39 resets, run visited all 3 properties in 128 ms. (steps per millisecond=17 )
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 139 ms.
All properties solved without resorting to model-checking.
Total runtime 12838 ms.
ITS solved all properties within timeout

BK_STOP 1717188013618

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-05b, 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 r468-smll-171620167100135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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