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-171620166000134.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-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166000134
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716284356167

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:39:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:39:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:39:18] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-21 09:39:18] [INFO ] Transformed 482 places.
[2024-05-21 09:39:18] [INFO ] Transformed 480 transitions.
[2024-05-21 09:39:18] [INFO ] Found NUPN structural information;
[2024-05-21 09:39:18] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 126 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (163 resets) in 2191 ms. (18 steps per ms) remains 8/14 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (17 resets) in 943 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 337 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 635 ms. (62 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (14 resets) in 352 ms. (113 steps per ms) remains 6/8 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (16 resets) in 220 ms. (181 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 150 ms. (264 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 480 rows 482 cols
[2024-05-21 09:39:20] [INFO ] Computed 34 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutoFlight-PT-05b-ReachabilityCardinality-2024-07 is UNSAT
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 387/456 variables, 32/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 387/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/460 variables, 1/489 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/493 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/493 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22/482 variables, 1/494 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 22/516 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/998 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/998 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1180 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: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 402/449 variables, 31/78 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 402/480 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 29 ms to minimize.
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 6/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/457 variables, 2/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 8/496 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 1/497 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 1/498 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/498 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 25/482 variables, 1/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 25/524 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:23] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 4 ms to minimize.
[2024-05-21 09:39:23] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 5 ms to minimize.
[2024-05-21 09:39:23] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 4 ms to minimize.
[2024-05-21 09:39:23] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 4 ms to minimize.
[2024-05-21 09:39:24] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 5 ms to minimize.
[2024-05-21 09:39:24] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-05-21 09:39:24] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 4 ms to minimize.
[2024-05-21 09:39:24] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 4 ms to minimize.
[2024-05-21 09:39:24] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 4 ms to minimize.
[2024-05-21 09:39:25] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-21 09:39:25] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 4 ms to minimize.
[2024-05-21 09:39:25] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 4 ms to minimize.
[2024-05-21 09:39:25] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 13/537 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:25] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/538 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/538 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 480/962 variables, 482/1020 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 3/1023 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 09:39:26] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/962 variables, and 1024 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5008 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: 3/4 constraints, Known Traps: 23/23 constraints]
After SMT, in 6336ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 482 transition count 339
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 164 rules applied. Total rules applied 305 place count 341 transition count 316
Reduce places removed 5 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 17 rules applied. Total rules applied 322 place count 336 transition count 304
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 334 place count 324 transition count 304
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 334 place count 324 transition count 246
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 450 place count 266 transition count 246
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 486 place count 230 transition count 210
Iterating global reduction 4 with 36 rules applied. Total rules applied 522 place count 230 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 525 place count 230 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 526 place count 229 transition count 207
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 526 place count 229 transition count 198
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 544 place count 220 transition count 198
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 614 place count 185 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 619 place count 185 transition count 158
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 621 place count 184 transition count 157
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 639 place count 184 transition count 139
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 657 place count 166 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 658 place count 165 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 659 place count 164 transition count 138
Applied a total of 659 rules in 227 ms. Remains 164 /482 variables (removed 318) and now considering 138/480 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 164/482 places, 138/480 transitions.
RANDOM walk for 40000 steps (615 resets) in 649 ms. (61 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (112 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (150 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
// Phase 1: matrix 138 rows 164 cols
[2024-05-21 09:39:27] [INFO ] Computed 33 invariants in 2 ms
[2024-05-21 09:39:27] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/141 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/145 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/164 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 138/302 variables, 164/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 23/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/141 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 09:39:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 09:39:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/145 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/164 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 09:39:27] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 09:39:27] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 3 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 6 ms to minimize.
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 138/302 variables, 164/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 23/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 236 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1686ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 204 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=68 )
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 54 ms.
All properties solved without resorting to model-checking.
Total runtime 11038 ms.
ITS solved all properties within timeout

BK_STOP 1716284369104

--------------------
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 ReachabilityCardinality -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="ReachabilityCardinality"
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-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166000134"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;