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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 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 134K 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-06b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716288476738

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:47:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:47:59] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2024-05-21 10:47:59] [INFO ] Transformed 574 places.
[2024-05-21 10:47:59] [INFO ] Transformed 572 transitions.
[2024-05-21 10:47:59] [INFO ] Found NUPN structural information;
[2024-05-21 10:47:59] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (137 resets) in 3051 ms. (13 steps per ms) remains 6/16 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 642 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 756 ms. (52 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (12 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 361 ms. (110 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
// Phase 1: matrix 572 rows 574 cols
[2024-05-21 10:48:01] [INFO ] Computed 40 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 372/416 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 372/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/544 variables, 14/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 128/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 30/574 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 30/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 572/1146 variables, 574/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1146 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 1188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1797 ms.
Refiners :[Domain max(s): 574/574 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 574/574 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/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 372/416 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 372/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:48:04] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 35 ms to minimize.
[2024-05-21 10:48:04] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-05-21 10:48:04] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-21 10:48:04] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-05-21 10:48:04] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 5/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:48:05] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 4 ms to minimize.
[2024-05-21 10:48:05] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 128/544 variables, 14/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 128/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:48:05] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 4 ms to minimize.
[2024-05-21 10:48:05] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 7 ms to minimize.
[2024-05-21 10:48:06] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 4 ms to minimize.
[2024-05-21 10:48:06] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 4 ms to minimize.
[2024-05-21 10:48:06] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:48:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/574 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 30/627 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:48:06] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 5 ms to minimize.
[2024-05-21 10:48:07] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 6 ms to minimize.
[2024-05-21 10:48:07] [INFO ] Deduced a trap composed of 79 places in 265 ms of which 4 ms to minimize.
[2024-05-21 10:48:07] [INFO ] Deduced a trap composed of 81 places in 338 ms of which 6 ms to minimize.
[2024-05-21 10:48:08] [INFO ] Deduced a trap composed of 92 places in 294 ms of which 6 ms to minimize.
[2024-05-21 10:48:08] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 4 ms to minimize.
[2024-05-21 10:48:08] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 5 ms to minimize.
[2024-05-21 10:48:09] [INFO ] Deduced a trap composed of 88 places in 301 ms of which 6 ms to minimize.
SMT process timed out in 7174ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 574 transition count 400
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 204 rules applied. Total rules applied 376 place count 402 transition count 368
Reduce places removed 9 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 28 rules applied. Total rules applied 404 place count 393 transition count 349
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 427 place count 374 transition count 345
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 427 place count 374 transition count 275
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 567 place count 304 transition count 275
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 614 place count 257 transition count 228
Iterating global reduction 4 with 47 rules applied. Total rules applied 661 place count 257 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 662 place count 257 transition count 227
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 662 place count 257 transition count 218
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 680 place count 248 transition count 218
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 9 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 780 place count 198 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 782 place count 197 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 783 place count 197 transition count 167
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 796 place count 197 transition count 154
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 809 place count 184 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 810 place count 183 transition count 153
Applied a total of 810 rules in 294 ms. Remains 183 /574 variables (removed 391) and now considering 153/572 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 183/574 places, 153/572 transitions.
RANDOM walk for 40000 steps (595 resets) in 879 ms. (45 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (62 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
// Phase 1: matrix 153 rows 183 cols
[2024-05-21 10:48:09] [INFO ] Computed 40 invariants in 3 ms
[2024-05-21 10:48:09] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/116 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/161 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/183 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 153/336 variables, 183/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 25/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 248 constraints, problems are : Problem set: 0 solved, 3 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 25/25 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 87/116 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 45/161 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/183 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 3 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-21 10:48:10] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 11 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 153/336 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 25/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 10:48:11] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 4 ms to minimize.
[2024-05-21 10:48:12] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-21 10:48:12] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 3 ms to minimize.
[2024-05-21 10:48:12] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-21 10:48:12] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-21 10:48:12] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/336 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 275 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 183/183 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 3053ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1303 ms.
Support contains 16 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 183 transition count 142
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 172 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 171 transition count 141
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 24 place count 171 transition count 131
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 44 place count 161 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 160 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 160 transition count 130
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 68 place count 149 transition count 119
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 149 transition count 111
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 84 place count 141 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 139 transition count 109
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 93 place count 133 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 132 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 94 place count 132 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 104 place count 127 transition count 103
Applied a total of 104 rules in 58 ms. Remains 127 /183 variables (removed 56) and now considering 103/153 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 127/183 places, 103/153 transitions.
RANDOM walk for 40000 steps (984 resets) in 253 ms. (157 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 39340 steps (149 resets) in 131 ms. (298 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 14993 ms.
ITS solved all properties within timeout

BK_STOP 1716288494482

--------------------
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-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutoFlight-PT-06b, 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 r025-smll-171620166000151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "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 ;