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-171683758900487.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 ShieldPPPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758900487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.9K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 355K 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 ShieldPPPs-PT-040A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-040A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716985280155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 12:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:21:21] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-29 12:21:21] [INFO ] Transformed 1243 places.
[2024-05-29 12:21:21] [INFO ] Transformed 1043 transitions.
[2024-05-29 12:21:21] [INFO ] Found NUPN structural information;
[2024-05-29 12:21:21] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 2275 ms. (17 steps per ms) remains 5/16 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
// Phase 1: matrix 1043 rows 1243 cols
[2024-05-29 12:21:22] [INFO ] Computed 441 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 325/503 variables, 158/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 325/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 740/1243 variables, 283/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 740/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1043/2286 variables, 1243/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2286 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2286 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2286/2286 variables, and 2927 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1639 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 325/503 variables, 158/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 325/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 740/1243 variables, 283/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 740/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1043/2286 variables, 1243/2927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2286 variables, 5/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2286 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2286 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2286/2286 variables, and 2932 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5018 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6822ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 178 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1242 transition count 1042
Partial Free-agglomeration rule applied 269 times.
Drop transitions (Partial Free agglomeration) removed 269 transitions
Iterating global reduction 0 with 269 rules applied. Total rules applied 271 place count 1242 transition count 1042
Applied a total of 271 rules in 406 ms. Remains 1242 /1243 variables (removed 1) and now considering 1042/1043 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 1242/1243 places, 1042/1043 transitions.
RANDOM walk for 40000 steps (8 resets) in 1778 ms. (22 steps per ms) remains 3/5 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
// Phase 1: matrix 1042 rows 1242 cols
[2024-05-29 12:21:31] [INFO ] Computed 441 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 240/349 variables, 108/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 240/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 881/1230 variables, 327/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 881/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/1242 variables, 6/1671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1242 variables, 12/1683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1242 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1042/2284 variables, 1242/2925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2284 variables, 0/2925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2284 variables, 0/2925 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2284/2284 variables, and 2925 constraints, problems are : Problem set: 0 solved, 3 unsolved in 967 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 435/435 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1242/1242 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/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 240/349 variables, 108/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 240/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 881/1230 variables, 327/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 881/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:21:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 1/1666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/1242 variables, 6/1672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1242 variables, 12/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:21:32] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1242 variables, 1/1685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1042/2284 variables, 1242/2927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2284 variables, 3/2930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:21:35] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-05-29 12:21:36] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:21:37] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:21:38] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 12:21:38] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:21:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:21:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:21:39] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:21:39] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2284 variables, 19/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2284 variables, 0/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/2284 variables, 0/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2284/2284 variables, and 2949 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9647 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 435/435 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 21/21 constraints]
After SMT, in 10677ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3128 ms.
Support contains 84 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1241 transition count 1041
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 30 place count 1241 transition count 1041
Applied a total of 30 rules in 108 ms. Remains 1241 /1242 variables (removed 1) and now considering 1041/1042 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1241/1242 places, 1041/1042 transitions.
RANDOM walk for 40000 steps (8 resets) in 586 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 162706 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162706 steps, saw 152316 distinct states, run finished after 3007 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 12:21:48] [INFO ] Computed 441 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 188/272 variables, 83/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 188/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 933/1205 variables, 340/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1205 variables, 933/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1205 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 36/1241 variables, 18/1646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 36/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 2 unsolved in 822 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 423/423 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1241/1241 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/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 188/272 variables, 83/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 188/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 933/1205 variables, 340/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1205 variables, 933/1631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:21:49] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:21:50] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 9/1640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/1241 variables, 18/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 36/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 12:21:50] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:21:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:21:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 3/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1241 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1041/2282 variables, 1241/2938 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 2/2940 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 12:22:02] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:22:02] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:22:03] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:22:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:22:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:22:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:22:03] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2282 variables, 7/2947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2282 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2282 variables, 0/2947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2947 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15976 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 423/423 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
After SMT, in 16847ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3132 ms.
Support contains 84 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 37 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 34 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 12:22:08] [INFO ] Invariant cache hit.
[2024-05-29 12:22:09] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-29 12:22:09] [INFO ] Invariant cache hit.
[2024-05-29 12:22:10] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-29 12:22:10] [INFO ] Redundant transitions in 53 ms returned []
Running 1040 sub problems to find dead transitions.
[2024-05-29 12:22:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 1240/1240 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1240 variables, 18/1258 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/2282 variables, and 1258 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30041 ms.
Refiners :[Domain max(s): 1240/1241 constraints, Positive P Invariants (semi-flows): 0/423 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 1240/1240 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1240 variables, 18/1258 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1240 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (OVERLAPS) 1/1241 variables, 423/1681 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 1/1682 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-29 12:23:00] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 3 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 9 ms to minimize.
[2024-05-29 12:23:01] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 12:23:02] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 3 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-29 12:23:03] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:23:04] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 20/1722 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:23:06] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:23:07] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:23:08] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1241/2282 variables, and 1742 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30033 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 423/423 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1040 constraints, Known Traps: 60/60 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62741 ms. Remains : 1241/1241 places, 1041/1041 transitions.
[2024-05-29 12:23:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 12:23:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1241 places, 1041 transitions and 4817 arcs took 13 ms.
[2024-05-29 12:23:11] [INFO ] Flatten gal took : 169 ms
Total runtime 110225 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-040A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1241
TRANSITIONS: 1041
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 891
MODEL NAME: /home/mcc/execution/412/model
1241 places, 1041 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ShieldPPPs-PT-040A"
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 ShieldPPPs-PT-040A, 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-171683758900487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040A.tgz
mv ShieldPPPs-PT-040A 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 ;