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.r355-tall-171683759600831.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 ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759600831
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 370K May 18 16:43 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 ShieldRVs-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717055349177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 07:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:49:10] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-30 07:49:10] [INFO ] Transformed 1203 places.
[2024-05-30 07:49:10] [INFO ] Transformed 1353 transitions.
[2024-05-30 07:49:10] [INFO ] Found NUPN structural information;
[2024-05-30 07:49:10] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (28 resets) in 1742 ms. (22 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 431 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1153 ms. (34 steps per ms) remains 4/4 properties
// Phase 1: matrix 1353 rows 1203 cols
[2024-05-30 07:49:11] [INFO ] Computed 121 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1067/1203 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 1067/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1203 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1353/2556 variables, 1203/2527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2556/2556 variables, and 2527 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1405 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1203/1203 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/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1067/1203 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1203 variables, 1067/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:49:14] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 44 ms to minimize.
[2024-05-30 07:49:14] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 8 ms to minimize.
[2024-05-30 07:49:14] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 5 ms to minimize.
[2024-05-30 07:49:15] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 6 ms to minimize.
[2024-05-30 07:49:15] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 5 ms to minimize.
[2024-05-30 07:49:15] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 4 ms to minimize.
[2024-05-30 07:49:15] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 5 ms to minimize.
[2024-05-30 07:49:16] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 5 ms to minimize.
[2024-05-30 07:49:16] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 5 ms to minimize.
[2024-05-30 07:49:16] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 4 ms to minimize.
[2024-05-30 07:49:17] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-05-30 07:49:17] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 5 ms to minimize.
[2024-05-30 07:49:17] [INFO ] Deduced a trap composed of 29 places in 257 ms of which 5 ms to minimize.
[2024-05-30 07:49:17] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 5 ms to minimize.
[2024-05-30 07:49:18] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 5 ms to minimize.
[2024-05-30 07:49:18] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 5 ms to minimize.
SMT process timed out in 6646ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 136 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1203 transition count 1259
Reduce places removed 94 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 98 rules applied. Total rules applied 192 place count 1109 transition count 1255
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 196 place count 1105 transition count 1255
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 196 place count 1105 transition count 1118
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 470 place count 968 transition count 1118
Discarding 183 places :
Symmetric choice reduction at 3 with 183 rule applications. Total rules 653 place count 785 transition count 935
Iterating global reduction 3 with 183 rules applied. Total rules applied 836 place count 785 transition count 935
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 836 place count 785 transition count 886
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 934 place count 736 transition count 886
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 3 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 1312 place count 547 transition count 697
Partial Free-agglomeration rule applied 46 times.
Drop transitions (Partial Free agglomeration) removed 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 1358 place count 547 transition count 697
Applied a total of 1358 rules in 339 ms. Remains 547 /1203 variables (removed 656) and now considering 697/1353 (removed 656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 547/1203 places, 697/1353 transitions.
RANDOM walk for 40000 steps (68 resets) in 517 ms. (77 steps per ms) remains 2/4 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
// Phase 1: matrix 697 rows 547 cols
[2024-05-30 07:49:19] [INFO ] Computed 121 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 460/547 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 697/1244 variables, 547/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1244 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/1244 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1244/1244 variables, and 668 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 547/547 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/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 460/547 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:49:19] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-30 07:49:19] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-30 07:49:20] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:49:21] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 697/1244 variables, 547/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:49:22] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
[2024-05-30 07:49:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-30 07:49:22] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-30 07:49:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 07:49:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 07:49:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:49:24] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 07:49:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1244 variables, 17/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1244 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 07:49:24] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-30 07:49:24] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1244 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1244 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1244 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1244/1244 variables, and 712 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5544 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 42/42 constraints]
After SMT, in 5981ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1188 ms.
Support contains 87 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 697/697 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 547 transition count 691
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 541 transition count 691
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 12 place count 541 transition count 676
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 42 place count 526 transition count 676
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 5 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 88 place count 503 transition count 653
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 503 transition count 653
Applied a total of 95 rules in 77 ms. Remains 503 /547 variables (removed 44) and now considering 653/697 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 503/547 places, 653/697 transitions.
RANDOM walk for 40000 steps (80 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 653 rows 503 cols
[2024-05-30 07:49:26] [INFO ] Computed 121 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 457/503 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 653/1156 variables, 503/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1156 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/1156 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1156/1156 variables, and 624 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 503/503 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 457/503 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-30 07:49:27] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-30 07:49:28] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:49:29] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 653/1156 variables, 503/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1156 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:49:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1156 variables, 14/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-30 07:49:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1156 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1156 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1156 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1156/1156 variables, and 673 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4870 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 5158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 46 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 653/653 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 503 transition count 650
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 500 transition count 650
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 500 transition count 640
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 490 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 489 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 489 transition count 639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 489 transition count 638
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 488 transition count 638
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 64 place count 471 transition count 621
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 471 transition count 621
Applied a total of 71 rules in 81 ms. Remains 471 /503 variables (removed 32) and now considering 621/653 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 471/503 places, 621/653 transitions.
RANDOM walk for 40000 steps (90 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 19236 steps (2 resets) in 111 ms. (171 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 21907 ms.
ITS solved all properties within timeout

BK_STOP 1717055372284

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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 r355-tall-171683759600831"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B 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 ;