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-171620166100191.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-48a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166100191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:13 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 309K 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-48a-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716320025377

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-48a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 19:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:33:47] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-21 19:33:47] [INFO ] Transformed 1127 places.
[2024-05-21 19:33:47] [INFO ] Transformed 1113 transitions.
[2024-05-21 19:33:47] [INFO ] Found NUPN structural information;
[2024-05-21 19:33:47] [INFO ] Parsed PT model containing 1127 places and 1113 transitions and 3458 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 192 transitions
Reduce redundant transitions removed 192 transitions.
RANDOM walk for 40000 steps (277 resets) in 3490 ms. (11 steps per ms) remains 8/16 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 689 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 809 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
// Phase 1: matrix 921 rows 1127 cols
[2024-05-21 19:33:50] [INFO ] Computed 258 invariants in 42 ms
[2024-05-21 19:33:50] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-11 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 506/696 variables, 108/298 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-02 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-03 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 506/804 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/804 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 321/1017 variables, 149/953 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1017 variables, 321/1274 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1017 variables, 0/1274 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 110/1127 variables, 1/1275 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 110/1385 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/1385 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 921/2048 variables, 1127/2512 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2048 variables, 192/2704 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2048 variables, 0/2704 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2048 variables, 0/2704 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2048/2048 variables, and 2704 constraints, problems are : Problem set: 3 solved, 5 unsolved in 3402 ms.
Refiners :[Domain max(s): 1127/1127 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1127/1127 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 480/626 variables, 86/232 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 480/712 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/712 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 390/1016 variables, 171/883 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1016 variables, 390/1273 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1016 variables, 0/1273 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 111/1127 variables, 1/1274 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 111/1385 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 602 places in 529 ms of which 81 ms to minimize.
[2024-05-21 19:33:56] [INFO ] Deduced a trap composed of 588 places in 516 ms of which 16 ms to minimize.
[2024-05-21 19:33:56] [INFO ] Deduced a trap composed of 589 places in 460 ms of which 8 ms to minimize.
[2024-05-21 19:33:57] [INFO ] Deduced a trap composed of 474 places in 525 ms of which 8 ms to minimize.
[2024-05-21 19:33:57] [INFO ] Deduced a trap composed of 590 places in 531 ms of which 8 ms to minimize.
[2024-05-21 19:33:58] [INFO ] Deduced a trap composed of 599 places in 515 ms of which 8 ms to minimize.
[2024-05-21 19:33:58] [INFO ] Deduced a trap composed of 485 places in 504 ms of which 7 ms to minimize.
[2024-05-21 19:33:59] [INFO ] Deduced a trap composed of 592 places in 501 ms of which 8 ms to minimize.
SMT process timed out in 9244ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 146 out of 1127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 921/921 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1127 transition count 773
Reduce places removed 148 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 167 rules applied. Total rules applied 315 place count 979 transition count 754
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 334 place count 960 transition count 754
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 334 place count 960 transition count 698
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 446 place count 904 transition count 698
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 508 place count 873 transition count 667
Free-agglomeration rule applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 547 place count 873 transition count 628
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 586 place count 834 transition count 628
Applied a total of 586 rules in 420 ms. Remains 834 /1127 variables (removed 293) and now considering 628/921 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 834/1127 places, 628/921 transitions.
RANDOM walk for 40000 steps (602 resets) in 1059 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (28 resets) in 524 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 506 ms. (78 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 353 ms. (113 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
// Phase 1: matrix 628 rows 834 cols
[2024-05-21 19:34:00] [INFO ] Computed 258 invariants in 14 ms
[2024-05-21 19:34:00] [INFO ] State equation strengthened by 299 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 341/444 variables, 69/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 341/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 315/759 variables, 188/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 315/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 75/834 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 75/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 628/1462 variables, 834/1926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1462 variables, 299/2225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1462 variables, 0/2225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1462 variables, 0/2225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1462/1462 variables, and 2225 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1347 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 834/834 constraints, ReadFeed: 299/299 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/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 341/444 variables, 69/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 341/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 315/759 variables, 188/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 315/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 75/834 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 75/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:34:03] [INFO ] Deduced a trap composed of 421 places in 321 ms of which 6 ms to minimize.
[2024-05-21 19:34:03] [INFO ] Deduced a trap composed of 368 places in 311 ms of which 5 ms to minimize.
[2024-05-21 19:34:03] [INFO ] Deduced a trap composed of 419 places in 276 ms of which 6 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 429 places in 293 ms of which 6 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 417 places in 277 ms of which 5 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 413 places in 304 ms of which 5 ms to minimize.
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 414 places in 310 ms of which 6 ms to minimize.
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 425 places in 305 ms of which 6 ms to minimize.
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 429 places in 297 ms of which 6 ms to minimize.
[2024-05-21 19:34:06] [INFO ] Deduced a trap composed of 432 places in 346 ms of which 6 ms to minimize.
[2024-05-21 19:34:06] [INFO ] Deduced a trap composed of 434 places in 286 ms of which 5 ms to minimize.
[2024-05-21 19:34:06] [INFO ] Deduced a trap composed of 436 places in 298 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 12/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 628/1462 variables, 834/1938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1462 variables, 299/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1462 variables, 3/2240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:34:08] [INFO ] Deduced a trap composed of 419 places in 283 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1462 variables, 1/2241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1462 variables, 0/2241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 19:34:09] [INFO ] Deduced a trap composed of 447 places in 277 ms of which 5 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1462 variables, 1/2242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1462 variables, 0/2242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1462 variables, 0/2242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1462/1462 variables, and 2242 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7912 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 834/834 constraints, ReadFeed: 299/299 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 9382ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 796 ms.
Support contains 65 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 628/628 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 834 transition count 608
Reduce places removed 20 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 814 transition count 603
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 809 transition count 603
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 50 place count 809 transition count 592
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 798 transition count 592
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 114 place count 777 transition count 571
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 129 place count 777 transition count 556
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 144 place count 762 transition count 556
Applied a total of 144 rules in 183 ms. Remains 762 /834 variables (removed 72) and now considering 556/628 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 762/834 places, 556/628 transitions.
RANDOM walk for 40000 steps (680 resets) in 593 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204083 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204083 steps, saw 82197 distinct states, run finished after 3009 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 556 rows 762 cols
[2024-05-21 19:34:14] [INFO ] Computed 258 invariants in 5 ms
[2024-05-21 19:34:14] [INFO ] State equation strengthened by 340 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/350 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 285/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/688 variables, 208/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 338/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 74/762 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 74/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 556/1318 variables, 762/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1318 variables, 340/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1318 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1318 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 2122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 742 ms.
Refiners :[Domain max(s): 762/762 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, ReadFeed: 340/340 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/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/350 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 285/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/688 variables, 208/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 338/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 74/762 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 74/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 556/1318 variables, 762/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1318 variables, 340/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1318 variables, 1/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1318 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1318 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 2123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1070 ms.
Refiners :[Domain max(s): 762/762 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, ReadFeed: 340/340 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1871ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1265 steps, including 42 resets, run visited all 1 properties in 15 ms. (steps per millisecond=84 )
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
All properties solved without resorting to model-checking.
Total runtime 29237 ms.
ITS solved all properties within timeout

BK_STOP 1716320056497

--------------------
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-48a"
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-48a, 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-171620166100191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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