About the Execution of LTSMin+red for CANConstruction-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1299.644 | 393249.00 | 446923.00 | 1220.70 | F?TTFTTTT?T?TFTT | 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.r476-tall-171620505000055.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 CANConstruction-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000055
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717180358297
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:32:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:32:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:32:39] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2024-05-31 18:32:39] [INFO ] Transformed 7922 places.
[2024-05-31 18:32:39] [INFO ] Transformed 14880 transitions.
[2024-05-31 18:32:39] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 2180 ms. (18 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1030 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
// Phase 1: matrix 14880 rows 7922 cols
[2024-05-31 18:32:41] [INFO ] Computed 121 invariants in 165 ms
[2024-05-31 18:32:41] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7705/7861 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7861 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/7862 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7862 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 60/7922 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7922 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 22802/22802 variables, and 8043 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 7922/7922 constraints, ReadFeed: 0/7140 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7705/7861 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:32:56] [INFO ] Deduced a trap composed of 105 places in 8417 ms of which 292 ms to minimize.
SMT process timed out in 15020ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 156 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 289 place count 7922 transition count 14591
Reduce places removed 289 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 1 with 351 rules applied. Total rules applied 640 place count 7633 transition count 14529
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 702 place count 7571 transition count 14529
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 702 place count 7571 transition count 14505
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 750 place count 7547 transition count 14505
Discarding 3421 places :
Symmetric choice reduction at 3 with 3421 rule applications. Total rules 4171 place count 4126 transition count 7663
Iterating global reduction 3 with 3421 rules applied. Total rules applied 7592 place count 4126 transition count 7663
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 6 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 7662 place count 4091 transition count 7628
Free-agglomeration rule applied 42 times.
Iterating global reduction 3 with 42 rules applied. Total rules applied 7704 place count 4091 transition count 7586
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 7746 place count 4049 transition count 7586
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7747 place count 4049 transition count 7585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7748 place count 4048 transition count 7585
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 5 with 101 rules applied. Total rules applied 7849 place count 4048 transition count 7585
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 7862 place count 4048 transition count 7585
Applied a total of 7862 rules in 4417 ms. Remains 4048 /7922 variables (removed 3874) and now considering 7585/14880 (removed 7295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4431 ms. Remains : 4048/7922 places, 7585/14880 transitions.
RANDOM walk for 40000 steps (88 resets) in 794 ms. (50 steps per ms) remains 4/6 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
// Phase 1: matrix 7585 rows 4048 cols
[2024-05-31 18:33:01] [INFO ] Computed 121 invariants in 46 ms
[2024-05-31 18:33:01] [INFO ] State equation strengthened by 7233 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3833/3987 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3987 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/3988 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3988 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 60/4048 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4048 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7585/11633 variables, 4048/4169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11633 variables, 7233/11402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11633 variables, 0/11402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/11633 variables, 0/11402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11633/11633 variables, and 11402 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 4048/4048 constraints, ReadFeed: 7233/7233 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3833/3987 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 18:33:12] [INFO ] Deduced a trap composed of 2 places in 3826 ms of which 22 ms to minimize.
[2024-05-31 18:33:14] [INFO ] Deduced a trap composed of 66 places in 2240 ms of which 20 ms to minimize.
[2024-05-31 18:33:17] [INFO ] Deduced a trap composed of 68 places in 2274 ms of which 19 ms to minimize.
[2024-05-31 18:33:19] [INFO ] Deduced a trap composed of 67 places in 2249 ms of which 18 ms to minimize.
[2024-05-31 18:33:21] [INFO ] Deduced a trap composed of 64 places in 2165 ms of which 19 ms to minimize.
[2024-05-31 18:33:24] [INFO ] Deduced a trap composed of 65 places in 2330 ms of which 19 ms to minimize.
[2024-05-31 18:33:26] [INFO ] Deduced a trap composed of 67 places in 2124 ms of which 18 ms to minimize.
[2024-05-31 18:33:28] [INFO ] Deduced a trap composed of 64 places in 2105 ms of which 17 ms to minimize.
[2024-05-31 18:33:30] [INFO ] Deduced a trap composed of 64 places in 1895 ms of which 18 ms to minimize.
[2024-05-31 18:33:32] [INFO ] Deduced a trap composed of 66 places in 2190 ms of which 18 ms to minimize.
[2024-05-31 18:33:34] [INFO ] Deduced a trap composed of 65 places in 2044 ms of which 17 ms to minimize.
[2024-05-31 18:33:37] [INFO ] Deduced a trap composed of 64 places in 2192 ms of which 18 ms to minimize.
[2024-05-31 18:33:39] [INFO ] Deduced a trap composed of 64 places in 2203 ms of which 32 ms to minimize.
[2024-05-31 18:33:41] [INFO ] Deduced a trap composed of 63 places in 2213 ms of which 18 ms to minimize.
[2024-05-31 18:33:43] [INFO ] Deduced a trap composed of 65 places in 2224 ms of which 18 ms to minimize.
[2024-05-31 18:33:46] [INFO ] Deduced a trap composed of 71 places in 2476 ms of which 19 ms to minimize.
[2024-05-31 18:33:48] [INFO ] Deduced a trap composed of 68 places in 1945 ms of which 17 ms to minimize.
[2024-05-31 18:33:50] [INFO ] Deduced a trap composed of 63 places in 1926 ms of which 17 ms to minimize.
[2024-05-31 18:33:52] [INFO ] Deduced a trap composed of 63 places in 1934 ms of which 17 ms to minimize.
[2024-05-31 18:33:54] [INFO ] Deduced a trap composed of 63 places in 1913 ms of which 17 ms to minimize.
SMT process timed out in 52804ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 154 out of 4048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4048/4048 places, 7585/7585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4047 transition count 7584
Applied a total of 2 rules in 979 ms. Remains 4047 /4048 variables (removed 1) and now considering 7584/7585 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 4047/4048 places, 7584/7585 transitions.
RANDOM walk for 40000 steps (87 resets) in 739 ms. (54 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
// Phase 1: matrix 7584 rows 4047 cols
[2024-05-31 18:33:55] [INFO ] Computed 121 invariants in 40 ms
[2024-05-31 18:33:55] [INFO ] State equation strengthened by 7234 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3859/3982 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3982 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/3986 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3986 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/4046 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4046 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7584/11630 variables, 4046/4167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11630 variables, 7234/11401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11630 variables, 0/11401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/11631 variables, 1/11402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11631 variables, 0/11402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/11631 variables, 0/11402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11631/11631 variables, and 11402 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 4047/4047 constraints, ReadFeed: 7234/7234 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3859/3982 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:34:05] [INFO ] Deduced a trap composed of 5 places in 3303 ms of which 20 ms to minimize.
[2024-05-31 18:34:09] [INFO ] Deduced a trap composed of 2 places in 3652 ms of which 22 ms to minimize.
[2024-05-31 18:34:13] [INFO ] Deduced a trap composed of 63 places in 3459 ms of which 21 ms to minimize.
[2024-05-31 18:34:16] [INFO ] Deduced a trap composed of 2 places in 3578 ms of which 21 ms to minimize.
[2024-05-31 18:34:20] [INFO ] Deduced a trap composed of 3 places in 3686 ms of which 23 ms to minimize.
[2024-05-31 18:34:24] [INFO ] Deduced a trap composed of 2 places in 3624 ms of which 21 ms to minimize.
[2024-05-31 18:34:27] [INFO ] Deduced a trap composed of 3 places in 3628 ms of which 21 ms to minimize.
[2024-05-31 18:34:29] [INFO ] Deduced a trap composed of 71 places in 1964 ms of which 17 ms to minimize.
[2024-05-31 18:34:31] [INFO ] Deduced a trap composed of 65 places in 1614 ms of which 16 ms to minimize.
[2024-05-31 18:34:33] [INFO ] Deduced a trap composed of 71 places in 1906 ms of which 18 ms to minimize.
[2024-05-31 18:34:35] [INFO ] Deduced a trap composed of 65 places in 1833 ms of which 17 ms to minimize.
[2024-05-31 18:34:37] [INFO ] Deduced a trap composed of 66 places in 1863 ms of which 17 ms to minimize.
[2024-05-31 18:34:39] [INFO ] Deduced a trap composed of 65 places in 1881 ms of which 19 ms to minimize.
[2024-05-31 18:34:41] [INFO ] Deduced a trap composed of 64 places in 1906 ms of which 19 ms to minimize.
[2024-05-31 18:34:43] [INFO ] Deduced a trap composed of 64 places in 1891 ms of which 18 ms to minimize.
[2024-05-31 18:34:45] [INFO ] Deduced a trap composed of 65 places in 2197 ms of which 17 ms to minimize.
[2024-05-31 18:34:47] [INFO ] Deduced a trap composed of 76 places in 1793 ms of which 17 ms to minimize.
[2024-05-31 18:34:49] [INFO ] Deduced a trap composed of 66 places in 2193 ms of which 18 ms to minimize.
[2024-05-31 18:34:51] [INFO ] Deduced a trap composed of 69 places in 1771 ms of which 16 ms to minimize.
[2024-05-31 18:34:53] [INFO ] Deduced a trap composed of 65 places in 1920 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3982 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:34:55] [INFO ] Deduced a trap composed of 66 places in 1827 ms of which 18 ms to minimize.
[2024-05-31 18:34:57] [INFO ] Deduced a trap composed of 65 places in 1899 ms of which 18 ms to minimize.
[2024-05-31 18:34:59] [INFO ] Deduced a trap composed of 68 places in 1861 ms of which 17 ms to minimize.
[2024-05-31 18:35:00] [INFO ] Deduced a trap composed of 64 places in 1580 ms of which 16 ms to minimize.
[2024-05-31 18:35:02] [INFO ] Deduced a trap composed of 64 places in 1856 ms of which 18 ms to minimize.
[2024-05-31 18:35:04] [INFO ] Deduced a trap composed of 64 places in 1773 ms of which 16 ms to minimize.
[2024-05-31 18:35:06] [INFO ] Deduced a trap composed of 66 places in 1669 ms of which 16 ms to minimize.
[2024-05-31 18:35:07] [INFO ] Deduced a trap composed of 65 places in 1659 ms of which 16 ms to minimize.
[2024-05-31 18:35:09] [INFO ] Deduced a trap composed of 66 places in 1806 ms of which 17 ms to minimize.
[2024-05-31 18:35:11] [INFO ] Deduced a trap composed of 75 places in 1982 ms of which 17 ms to minimize.
[2024-05-31 18:35:13] [INFO ] Deduced a trap composed of 67 places in 1741 ms of which 17 ms to minimize.
[2024-05-31 18:35:15] [INFO ] Deduced a trap composed of 64 places in 1848 ms of which 16 ms to minimize.
[2024-05-31 18:35:17] [INFO ] Deduced a trap composed of 64 places in 1841 ms of which 17 ms to minimize.
SMT process timed out in 81744ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 123 out of 4047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4047/4047 places, 7584/7584 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 4047 transition count 7580
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 4043 transition count 7580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 4043 transition count 7579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4042 transition count 7579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 4041 transition count 7577
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 4041 transition count 7577
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 50 place count 4022 transition count 7558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 4021 transition count 7558
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 2 with 34 rules applied. Total rules applied 86 place count 4021 transition count 7524
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 120 place count 3987 transition count 7524
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 3987 transition count 7524
Applied a total of 122 rules in 2903 ms. Remains 3987 /4047 variables (removed 60) and now considering 7524/7584 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2903 ms. Remains : 3987/4047 places, 7524/7584 transitions.
RANDOM walk for 40000 steps (89 resets) in 650 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 143441 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 143441 steps, saw 128087 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 7524 rows 3987 cols
[2024-05-31 18:35:23] [INFO ] Computed 121 invariants in 38 ms
[2024-05-31 18:35:23] [INFO ] State equation strengthened by 7251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3799/3922 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3922 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/3926 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3926 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/3986 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3986 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7524/11510 variables, 3986/4107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11510 variables, 7251/11358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11510 variables, 0/11358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/11511 variables, 1/11359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11511 variables, 0/11359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/11511 variables, 0/11359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11511/11511 variables, and 11359 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6033 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 3987/3987 constraints, ReadFeed: 7251/7251 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3799/3922 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:35:33] [INFO ] Deduced a trap composed of 2 places in 2890 ms of which 21 ms to minimize.
[2024-05-31 18:35:35] [INFO ] Deduced a trap composed of 64 places in 1855 ms of which 16 ms to minimize.
[2024-05-31 18:35:36] [INFO ] Deduced a trap composed of 63 places in 1715 ms of which 18 ms to minimize.
[2024-05-31 18:35:38] [INFO ] Deduced a trap composed of 64 places in 1834 ms of which 18 ms to minimize.
[2024-05-31 18:35:40] [INFO ] Deduced a trap composed of 64 places in 1661 ms of which 16 ms to minimize.
[2024-05-31 18:35:42] [INFO ] Deduced a trap composed of 64 places in 1649 ms of which 16 ms to minimize.
[2024-05-31 18:35:43] [INFO ] Deduced a trap composed of 66 places in 1557 ms of which 16 ms to minimize.
[2024-05-31 18:35:45] [INFO ] Deduced a trap composed of 66 places in 1524 ms of which 15 ms to minimize.
[2024-05-31 18:35:46] [INFO ] Deduced a trap composed of 66 places in 1468 ms of which 16 ms to minimize.
[2024-05-31 18:35:48] [INFO ] Deduced a trap composed of 69 places in 1442 ms of which 16 ms to minimize.
[2024-05-31 18:35:50] [INFO ] Deduced a trap composed of 73 places in 1809 ms of which 16 ms to minimize.
[2024-05-31 18:35:51] [INFO ] Deduced a trap composed of 63 places in 1536 ms of which 16 ms to minimize.
[2024-05-31 18:35:53] [INFO ] Deduced a trap composed of 66 places in 1480 ms of which 15 ms to minimize.
[2024-05-31 18:35:54] [INFO ] Deduced a trap composed of 66 places in 1404 ms of which 15 ms to minimize.
[2024-05-31 18:35:56] [INFO ] Deduced a trap composed of 64 places in 1301 ms of which 14 ms to minimize.
[2024-05-31 18:35:57] [INFO ] Deduced a trap composed of 64 places in 1764 ms of which 16 ms to minimize.
[2024-05-31 18:35:59] [INFO ] Deduced a trap composed of 64 places in 1263 ms of which 14 ms to minimize.
[2024-05-31 18:36:00] [INFO ] Deduced a trap composed of 63 places in 1240 ms of which 14 ms to minimize.
[2024-05-31 18:36:02] [INFO ] Deduced a trap composed of 63 places in 1833 ms of which 18 ms to minimize.
[2024-05-31 18:36:03] [INFO ] Deduced a trap composed of 63 places in 1402 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3922 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:36:05] [INFO ] Deduced a trap composed of 64 places in 1389 ms of which 15 ms to minimize.
[2024-05-31 18:36:06] [INFO ] Deduced a trap composed of 63 places in 1343 ms of which 15 ms to minimize.
[2024-05-31 18:36:08] [INFO ] Deduced a trap composed of 63 places in 1876 ms of which 18 ms to minimize.
[2024-05-31 18:36:10] [INFO ] Deduced a trap composed of 65 places in 1565 ms of which 16 ms to minimize.
[2024-05-31 18:36:11] [INFO ] Deduced a trap composed of 65 places in 1566 ms of which 15 ms to minimize.
[2024-05-31 18:36:13] [INFO ] Deduced a trap composed of 63 places in 1514 ms of which 15 ms to minimize.
[2024-05-31 18:36:15] [INFO ] Deduced a trap composed of 63 places in 1511 ms of which 16 ms to minimize.
[2024-05-31 18:36:16] [INFO ] Deduced a trap composed of 63 places in 1432 ms of which 15 ms to minimize.
[2024-05-31 18:36:18] [INFO ] Deduced a trap composed of 65 places in 1419 ms of which 15 ms to minimize.
[2024-05-31 18:36:19] [INFO ] Deduced a trap composed of 65 places in 1718 ms of which 17 ms to minimize.
[2024-05-31 18:36:21] [INFO ] Deduced a trap composed of 66 places in 1322 ms of which 14 ms to minimize.
[2024-05-31 18:36:22] [INFO ] Deduced a trap composed of 66 places in 1338 ms of which 15 ms to minimize.
[2024-05-31 18:36:23] [INFO ] Deduced a trap composed of 66 places in 1333 ms of which 15 ms to minimize.
[2024-05-31 18:36:25] [INFO ] Deduced a trap composed of 63 places in 1662 ms of which 16 ms to minimize.
[2024-05-31 18:36:27] [INFO ] Deduced a trap composed of 67 places in 1592 ms of which 16 ms to minimize.
[2024-05-31 18:36:28] [INFO ] Deduced a trap composed of 65 places in 1327 ms of which 15 ms to minimize.
[2024-05-31 18:36:30] [INFO ] Deduced a trap composed of 66 places in 1295 ms of which 14 ms to minimize.
[2024-05-31 18:36:31] [INFO ] Deduced a trap composed of 63 places in 1227 ms of which 14 ms to minimize.
[2024-05-31 18:36:32] [INFO ] Deduced a trap composed of 66 places in 1158 ms of which 14 ms to minimize.
[2024-05-31 18:36:34] [INFO ] Deduced a trap composed of 63 places in 1362 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3922 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:36:35] [INFO ] Deduced a trap composed of 64 places in 1468 ms of which 14 ms to minimize.
[2024-05-31 18:36:36] [INFO ] Deduced a trap composed of 66 places in 1389 ms of which 14 ms to minimize.
[2024-05-31 18:36:38] [INFO ] Deduced a trap composed of 66 places in 1324 ms of which 15 ms to minimize.
[2024-05-31 18:36:40] [INFO ] Deduced a trap composed of 64 places in 1614 ms of which 16 ms to minimize.
[2024-05-31 18:36:41] [INFO ] Deduced a trap composed of 63 places in 1391 ms of which 15 ms to minimize.
[2024-05-31 18:36:42] [INFO ] Deduced a trap composed of 63 places in 1382 ms of which 16 ms to minimize.
[2024-05-31 18:36:44] [INFO ] Deduced a trap composed of 65 places in 1414 ms of which 15 ms to minimize.
[2024-05-31 18:36:45] [INFO ] Deduced a trap composed of 64 places in 1306 ms of which 13 ms to minimize.
[2024-05-31 18:36:47] [INFO ] Deduced a trap composed of 64 places in 1308 ms of which 15 ms to minimize.
[2024-05-31 18:36:48] [INFO ] Deduced a trap composed of 64 places in 1290 ms of which 14 ms to minimize.
[2024-05-31 18:36:49] [INFO ] Deduced a trap composed of 63 places in 1336 ms of which 14 ms to minimize.
[2024-05-31 18:36:51] [INFO ] Deduced a trap composed of 66 places in 1330 ms of which 15 ms to minimize.
[2024-05-31 18:36:52] [INFO ] Deduced a trap composed of 66 places in 1361 ms of which 15 ms to minimize.
[2024-05-31 18:36:54] [INFO ] Deduced a trap composed of 65 places in 1454 ms of which 15 ms to minimize.
[2024-05-31 18:36:55] [INFO ] Deduced a trap composed of 67 places in 1395 ms of which 14 ms to minimize.
[2024-05-31 18:36:57] [INFO ] Deduced a trap composed of 66 places in 1435 ms of which 16 ms to minimize.
[2024-05-31 18:36:58] [INFO ] Deduced a trap composed of 63 places in 1689 ms of which 16 ms to minimize.
[2024-05-31 18:37:00] [INFO ] Deduced a trap composed of 66 places in 1298 ms of which 15 ms to minimize.
SMT process timed out in 96656ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 123 out of 3987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3987/3987 places, 7524/7524 transitions.
Applied a total of 0 rules in 520 ms. Remains 3987 /3987 variables (removed 0) and now considering 7524/7524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 3987/3987 places, 7524/7524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3987/3987 places, 7524/7524 transitions.
Applied a total of 0 rules in 521 ms. Remains 3987 /3987 variables (removed 0) and now considering 7524/7524 (removed 0) transitions.
[2024-05-31 18:37:01] [INFO ] Invariant cache hit.
[2024-05-31 18:37:03] [INFO ] Implicit Places using invariants in 2353 ms returned [5, 9, 15, 19, 26, 30, 35, 41, 47, 54, 60, 66, 72, 78, 85, 90, 94, 100, 104, 111, 118, 124, 130, 136, 141, 145, 151, 158, 162, 166, 172, 178, 185, 191, 196, 202, 209, 216, 220, 224, 230, 237, 243, 250, 256, 262, 269, 275, 279, 285, 290, 297, 301, 305, 312, 318, 325, 331, 336, 340]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2363 ms to find 60 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3927/3987 places, 7524/7524 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 3927 transition count 7509
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 3912 transition count 7509
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 40 place count 3902 transition count 7499
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 3902 transition count 7499
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 116 place count 3869 transition count 7466
Applied a total of 116 rules in 1527 ms. Remains 3869 /3927 variables (removed 58) and now considering 7466/7524 (removed 58) transitions.
// Phase 1: matrix 7466 rows 3869 cols
[2024-05-31 18:37:05] [INFO ] Computed 61 invariants in 133 ms
[2024-05-31 18:37:07] [INFO ] Implicit Places using invariants in 2248 ms returned []
[2024-05-31 18:37:07] [INFO ] Invariant cache hit.
[2024-05-31 18:37:09] [INFO ] State equation strengthened by 7155 read => feed constraints.
[2024-05-31 18:37:40] [INFO ] Performed 885/3869 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 18:38:10] [INFO ] Performed 1566/3869 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 18:38:40] [INFO ] Performed 2228/3869 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 18:39:10] [INFO ] Performed 2903/3869 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-31 18:39:10] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-31 18:39:10] [INFO ] Implicit Places using invariants and state equation in 123085 ms returned []
Implicit Place search using SMT with State Equation took 125334 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3869/3987 places, 7466/7524 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 129748 ms. Remains : 3869/3987 places, 7466/7524 transitions.
[2024-05-31 18:39:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-31 18:39:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3869 places, 7466 transitions and 29473 arcs took 34 ms.
[2024-05-31 18:39:11] [INFO ] Flatten gal took : 397 ms
Total runtime 391802 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 : CANConstruction-PT-060-ReachabilityFireability-2024-01
Could not compute solution for formula : CANConstruction-PT-060-ReachabilityFireability-2024-09
Could not compute solution for formula : CANConstruction-PT-060-ReachabilityFireability-2024-11
BK_STOP 1717180751546
--------------------
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 CANConstruction-PT-060-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/897/inv_0_
rfs formula name CANConstruction-PT-060-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/897/inv_1_
rfs formula name CANConstruction-PT-060-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/897/inv_2_
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="CANConstruction-PT-060"
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 CANConstruction-PT-060, 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 r476-tall-171620505000055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-060.tgz
mv CANConstruction-PT-060 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 ;