About the Execution of LTSMin+red for ShieldPPPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1739.823 | 138106.00 | 190940.00 | 257.20 | TTTFT?TTTTTTTTFT | 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-171683761200487.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761200487
=====================================================================
--------------------
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 1717249004139
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-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:36:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:36:45] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 13:36:45] [INFO ] Transformed 1243 places.
[2024-06-01 13:36:45] [INFO ] Transformed 1043 transitions.
[2024-06-01 13:36:45] [INFO ] Found NUPN structural information;
[2024-06-01 13:36:45] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 268 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 1959 ms. (20 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 40004 steps (8 resets) in 728 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
// Phase 1: matrix 1043 rows 1243 cols
[2024-06-01 13:36:46] [INFO ] Computed 441 invariants in 16 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 1729 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 4860 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 6729ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 9732 ms.
Support contains 91 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Partial Free-agglomeration rule applied 307 times.
Drop transitions (Partial Free agglomeration) removed 307 transitions
Iterating global reduction 0 with 307 rules applied. Total rules applied 311 place count 1241 transition count 1041
Applied a total of 311 rules in 362 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 1241/1243 places, 1041/1043 transitions.
RANDOM walk for 40000 steps (8 resets) in 1131 ms. (35 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 2/2 properties
// Phase 1: matrix 1041 rows 1241 cols
[2024-06-01 13:37:04] [INFO ] Computed 441 invariants in 31 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) 186/270 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 186/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 924/1194 variables, 335/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 924/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/1241 variables, 24/1635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 47/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 885 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 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) 186/270 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 186/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 924/1194 variables, 335/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 924/1612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1194 variables, 6/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1194 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/1241 variables, 24/1642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 47/1689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 20 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 5/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1241 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1041/2282 variables, 1241/2935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 2/2937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2282 variables, 17/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2282 variables, 0/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2282 variables, 0/2954 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2954 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12727 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 13700ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1513 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.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1241 transition count 1041
Applied a total of 3 rules in 148 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 148 ms. Remains : 1241/1241 places, 1041/1041 transitions.
RANDOM walk for 40000 steps (8 resets) in 771 ms. (51 steps per ms) remains 1/2 properties
FORMULA ShieldPPPs-PT-040A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
// Phase 1: matrix 1041 rows 1241 cols
[2024-06-01 13:37:20] [INFO ] Computed 441 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 101/144 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 101/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1050/1194 variables, 375/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 1050/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 47/1241 variables, 24/1635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 47/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 633 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 101/144 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 101/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1050/1194 variables, 375/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1194 variables, 1050/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 5 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1194 variables, 9/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1194 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/1241 variables, 24/1644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 47/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
[2024-06-01 13:37:21] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1241 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1041/2282 variables, 1241/2935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2282 variables, 1/2936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:37:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 17/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2282 variables, 0/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2282 variables, 0/2953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2953 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25595 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 417/417 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 26269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 817 ms.
Support contains 43 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 1241 transition count 1041
Applied a total of 19 rules in 76 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 77 ms. Remains : 1241/1241 places, 1041/1041 transitions.
RANDOM walk for 40000 steps (8 resets) in 692 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200575 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200575 steps, saw 187135 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 1041 rows 1241 cols
[2024-06-01 13:37:50] [INFO ] Computed 441 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/142 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 99/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1189 variables, 373/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 1047/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 0/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/1241 variables, 27/1630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 52/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1041/2282 variables, 1241/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2282 variables, 0/2923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2282/2282 variables, and 2923 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 414/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 99/142 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 99/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1189 variables, 373/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1189 variables, 1047/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1189 variables, 3/1606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1189 variables, 0/1606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/1241 variables, 27/1633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 52/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1241 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1041/2282 variables, 1241/2926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2282 variables, 1/2927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2282 variables, 5/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2282 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2282 variables, 0/2932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2282/2282 variables, and 2932 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5401 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 414/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1979 ms.
Support contains 43 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 35 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 35 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 35 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-06-01 13:37:58] [INFO ] Invariant cache hit.
[2024-06-01 13:37:59] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-06-01 13:37:59] [INFO ] Invariant cache hit.
[2024-06-01 13:38:01] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2294 ms to find 0 implicit places.
[2024-06-01 13:38:01] [INFO ] Redundant transitions in 60 ms returned []
Running 1040 sub problems to find dead transitions.
[2024-06-01 13:38:01] [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, 27/1267 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 1267 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30034 ms.
Refiners :[Domain max(s): 1240/1241 constraints, Positive P Invariants (semi-flows): 0/414 constraints, Generalized P Invariants (flows): 27/27 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, 27/1267 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1240 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (OVERLAPS) 1/1241 variables, 414/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-06-01 13:38:50] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:38:51] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 4 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-06-01 13:38:52] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 3 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 7 places in 114 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-06-01 13:38:53] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 3 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 5 places in 92 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-06-01 13:38:56] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 5 places in 60 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
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 20/1762 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1241/2282 variables, and 1769 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30024 ms.
Refiners :[Domain max(s): 1241/1241 constraints, Positive P Invariants (semi-flows): 414/414 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1040 constraints, Known Traps: 87/87 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62873 ms. Remains : 1241/1241 places, 1041/1041 transitions.
[2024-06-01 13:39:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 13:39:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1241 places, 1041 transitions and 4912 arcs took 15 ms.
[2024-06-01 13:39:02] [INFO ] Flatten gal took : 185 ms
Total runtime 136800 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-040A-ReachabilityFireability-2024-05
BK_STOP 1717249142245
--------------------
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-040A-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1016/inv_0_
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-040A"
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-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 r528-tall-171683761200487"
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 '
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 ;