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-171620167100167.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-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 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 266K 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-12b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717193433219

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-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:10:35] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-05-31 22:10:35] [INFO ] Transformed 1126 places.
[2024-05-31 22:10:35] [INFO ] Transformed 1124 transitions.
[2024-05-31 22:10:35] [INFO ] Found NUPN structural information;
[2024-05-31 22:10:35] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 123 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 2157 ms. (18 steps per ms) remains 8/15 properties
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1087 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
// Phase 1: matrix 1124 rows 1126 cols
[2024-05-31 22:10:37] [INFO ] Computed 76 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 934/1072 variables, 75/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1072 variables, 934/1147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1072 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutoFlight-PT-12b-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 54/1126 variables, 1/1148 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 54/1202 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1126 variables, 0/1202 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1124/2250 variables, 1126/2328 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2250 variables, 0/2328 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2250 variables, 0/2328 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2250/2250 variables, and 2328 constraints, problems are : Problem set: 1 solved, 7 unsolved in 4111 ms.
Refiners :[Domain max(s): 1126/1126 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1126/1126 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 133/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 938/1071 variables, 75/208 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1071 variables, 938/1146 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-31 22:10:42] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 55 ms to minimize.
[2024-05-31 22:10:42] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 5 ms to minimize.
[2024-05-31 22:10:43] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 5 ms to minimize.
[2024-05-31 22:10:43] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 4 ms to minimize.
[2024-05-31 22:10:43] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 4 ms to minimize.
[2024-05-31 22:10:43] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 4 ms to minimize.
[2024-05-31 22:10:43] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 4 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 4 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 4 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 111 places in 156 ms of which 4 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 5 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 5 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 5 ms to minimize.
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:10:46] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 4 ms to minimize.
[2024-05-31 22:10:46] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 4 ms to minimize.
[2024-05-31 22:10:46] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 4 ms to minimize.
SMT process timed out in 9327ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 133 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 297 place count 1126 transition count 827
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 342 rules applied. Total rules applied 639 place count 829 transition count 782
Reduce places removed 10 places and 0 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 2 with 59 rules applied. Total rules applied 698 place count 819 transition count 733
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 59 rules applied. Total rules applied 757 place count 770 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 759 place count 768 transition count 723
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 120 Pre rules applied. Total rules applied 759 place count 768 transition count 603
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 999 place count 648 transition count 603
Discarding 84 places :
Symmetric choice reduction at 5 with 84 rule applications. Total rules 1083 place count 564 transition count 519
Iterating global reduction 5 with 84 rules applied. Total rules applied 1167 place count 564 transition count 519
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1170 place count 564 transition count 516
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1170 place count 564 transition count 500
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1202 place count 548 transition count 500
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 6 with 182 rules applied. Total rules applied 1384 place count 457 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1388 place count 455 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1398 place count 455 transition count 399
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 1404 place count 452 transition count 396
Free-agglomeration rule applied 35 times.
Iterating global reduction 6 with 35 rules applied. Total rules applied 1439 place count 452 transition count 361
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 1474 place count 417 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1475 place count 417 transition count 360
Applied a total of 1475 rules in 426 ms. Remains 417 /1126 variables (removed 709) and now considering 360/1124 (removed 764) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 417/1126 places, 360/1124 transitions.
RANDOM walk for 40000 steps (255 resets) in 1069 ms. (37 steps per ms) remains 4/7 properties
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (22 resets) in 219 ms. (181 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 163 ms. (243 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (22 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 360 rows 417 cols
[2024-05-31 22:10:47] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 22:10:47] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/245 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/364 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/417 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/777 variables, 417/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 50/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/777 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 417/417 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/245 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 119/364 variables, 27/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/417 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 3 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 8 ms to minimize.
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 4 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:10:51] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-31 22:10:52] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 4 ms to minimize.
[2024-05-31 22:10:52] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-31 22:10:52] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 3 ms to minimize.
[2024-05-31 22:10:52] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 360/777 variables, 417/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 50/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/777 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 580 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4769 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 417/417 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 5157ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
FORMULA AutoFlight-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
All properties solved without resorting to model-checking.
Total runtime 17779 ms.
ITS solved all properties within timeout

BK_STOP 1717193452799

--------------------
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-12b"
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-12b, 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-171620167100167"
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 [ "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 ;