About the Execution of LTSMin+red for ShieldPPPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1760.491 | 190682.00 | 243070.00 | 483.80 | TT????TT?T??FT?? | normal |
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.r528-tall-171683761300519.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 ltsminxred
Input is ShieldPPPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761300519
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 907K 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-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717253869152
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:57:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:57:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:57:50] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-06-01 14:57:50] [INFO ] Transformed 3103 places.
[2024-06-01 14:57:50] [INFO ] Transformed 2603 transitions.
[2024-06-01 14:57:50] [INFO ] Found NUPN structural information;
[2024-06-01 14:57:50] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 412 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 (8 resets) in 2743 ms. (14 steps per ms) remains 10/16 properties
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 920 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1194 ms. (33 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 730 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 522 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 10/10 properties
// Phase 1: matrix 2603 rows 3103 cols
[2024-06-01 14:57:53] [INFO ] Computed 1101 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 276/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 542/818 variables, 257/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/818 variables, 542/1075 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/818 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2285/3103 variables, 844/1919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3103 variables, 2285/4204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3103 variables, 0/4204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5706 variables, 3103/7307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5706 variables, 0/7307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/5706 variables, 0/7307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5706/5706 variables, and 7307 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4149 ms.
Refiners :[Domain max(s): 3103/3103 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 3103/3103 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 276/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 542/818 variables, 257/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/818 variables, 542/1075 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/818 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2285/3103 variables, 844/1919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3103 variables, 2285/4204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3103 variables, 0/4204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5706 variables, 3103/7307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5706 variables, 10/7317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5706/5706 variables, and 7317 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5017 ms.
Refiners :[Domain max(s): 3103/3103 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 3103/3103 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 9401ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 40 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 763 times.
Drop transitions (Partial Free agglomeration) removed 763 transitions
Iterating global reduction 0 with 763 rules applied. Total rules applied 767 place count 3101 transition count 2601
Applied a total of 767 rules in 831 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 847 ms. Remains : 3101/3103 places, 2601/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 1562 ms. (25 steps per ms) remains 9/10 properties
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 562 ms. (71 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 657 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 525 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 9/9 properties
// Phase 1: matrix 2601 rows 3101 cols
[2024-06-01 14:58:05] [INFO ] Computed 1101 invariants in 87 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 533/806 variables, 252/525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/806 variables, 533/1058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2211/3017 variables, 805/1863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3017 variables, 2211/4074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3017 variables, 0/4074 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 84/3101 variables, 44/4118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 84/4202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/4202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2601/5702 variables, 3101/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5702/5702 variables, and 7303 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3996 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1057/1057 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 533/806 variables, 252/525 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/806 variables, 533/1058 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 7 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2211/3017 variables, 805/1868 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3017 variables, 2211/4079 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3017 variables, 20/4099 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3017 variables, 1/4100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3017 variables, 0/4100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 84/3101 variables, 44/4144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3101 variables, 84/4228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3101 variables, 9/4237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3101 variables, 1/4238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3101 variables, 0/4238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2601/5702 variables, 3101/7339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5702 variables, 9/7348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5702/5702 variables, and 7348 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45029 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1057/1057 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 36/36 constraints]
After SMT, in 49225ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 273 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3101 transition count 2601
Applied a total of 1 rules in 318 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 3101/3101 places, 2601/2601 transitions.
RANDOM walk for 40000 steps (8 resets) in 1283 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 635 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 674 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 644 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 63343 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 9
Probabilistic random walk after 63343 steps, saw 58240 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2601 rows 3101 cols
[2024-06-01 14:59:00] [INFO ] Computed 1101 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 535/808 variables, 253/526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/808 variables, 535/1061 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2210/3018 variables, 805/1866 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3018 variables, 2210/4076 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3018 variables, 0/4076 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 83/3101 variables, 43/4119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 83/4202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/4202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2601/5702 variables, 3101/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5702/5702 variables, and 7303 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3980 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1058/1058 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 535/808 variables, 253/526 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/808 variables, 535/1061 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 9/1070 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 2/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2210/3018 variables, 805/1877 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3018 variables, 2210/4087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:59:07] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/3018 variables, 20/4107 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:59:09] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:59:09] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3018 variables, 3/4110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3018 variables, 0/4110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 83/3101 variables, 43/4153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3101 variables, 83/4236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/3101 variables, 13/4249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3101 variables, 4/4253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3101 variables, 0/4253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2601/5702 variables, 3101/7354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5702 variables, 9/7363 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5702/5702 variables, and 7363 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75015 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1058/1058 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 51/51 constraints]
After SMT, in 79113ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 273 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 153 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 133 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-06-01 15:00:19] [INFO ] Invariant cache hit.
[2024-06-01 15:00:22] [INFO ] Implicit Places using invariants in 2379 ms returned []
[2024-06-01 15:00:22] [INFO ] Invariant cache hit.
[2024-06-01 15:00:26] [INFO ] Implicit Places using invariants and state equation in 4934 ms returned []
Implicit Place search using SMT with State Equation took 7322 ms to find 0 implicit places.
[2024-06-01 15:00:27] [INFO ] Redundant transitions in 168 ms returned []
Running 2600 sub problems to find dead transitions.
[2024-06-01 15:00:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3100 variables, 3100/3100 constraints. Problems are: Problem set: 0 solved, 2600 unsolved
SMT process timed out in 31618ms, After SMT, problems are : Problem set: 0 solved, 2600 unsolved
Search for dead transitions found 0 dead transitions in 31654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39299 ms. Remains : 3101/3101 places, 2601/2601 transitions.
[2024-06-01 15:00:58] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 15:00:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3101 places, 2601 transitions and 12133 arcs took 20 ms.
[2024-06-01 15:00:59] [INFO ] Flatten gal took : 447 ms
Total runtime 189302 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-14
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityFireability-2024-15
BK_STOP 1717254059834
--------------------
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
mcc2024
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/809/inv_0_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/809/inv_1_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/809/inv_2_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/809/inv_3_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/809/inv_4_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/809/inv_5_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/809/inv_6_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/809/inv_7_
rfs formula name ShieldPPPs-PT-100A-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/809/inv_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPs-PT-100A, 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 r528-tall-171683761300519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100A.tgz
mv ShieldPPPs-PT-100A 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 '
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 ;