About the Execution of LTSMin+red for DES-PT-60b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 713.968 | 158074.00 | 193399.00 | 349.40 | ??TT???T?T??T?T? | 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.r480-tall-171624189900759.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 DES-PT-60b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900759
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 139K 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 DES-PT-60b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-60b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717200724846
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:12:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:12:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:12:06] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-01 00:12:06] [INFO ] Transformed 519 places.
[2024-06-01 00:12:06] [INFO ] Transformed 470 transitions.
[2024-06-01 00:12:06] [INFO ] Found NUPN structural information;
[2024-06-01 00:12:06] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (334 resets) in 2021 ms. (19 steps per ms) remains 11/16 properties
FORMULA DES-PT-60b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 304 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 528 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (52 resets) in 709 ms. (56 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (42 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (50 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (60 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
// Phase 1: matrix 470 rows 519 cols
[2024-06-01 00:12:08] [INFO ] Computed 65 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 321/467 variables, 39/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 321/506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 51/518 variables, 25/531 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 51/582 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/519 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 470/989 variables, 519/1103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 1103 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5057 ms.
Refiners :[Domain max(s): 519/519 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 519/519 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 321/467 variables, 39/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 321/506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 45 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem DES-PT-60b-ReachabilityFireability-2024-09 is UNSAT
FORMULA DES-PT-60b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 51/518 variables, 25/541 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 51/592 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:12:16] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 2/594 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:17] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:12:18] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/989 variables, and 596 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5015 ms.
Refiners :[Domain max(s): 518/519 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/519 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 14/14 constraints]
After SMT, in 10381ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 515 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 515 transition count 461
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 507 transition count 461
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 17 place count 507 transition count 455
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 29 place count 501 transition count 455
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 492 transition count 446
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 492 transition count 446
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 490 transition count 444
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 490 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 490 transition count 442
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 123 place count 455 transition count 407
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 455 transition count 404
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 452 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 452 transition count 403
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 452 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 451 transition count 402
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 134 place count 451 transition count 402
Applied a total of 134 rules in 203 ms. Remains 451 /519 variables (removed 68) and now considering 402/470 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 451/519 places, 402/470 transitions.
RANDOM walk for 40000 steps (473 resets) in 874 ms. (45 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (63 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (70 resets) in 300 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (72 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (67 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (60 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 570864 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 10
Probabilistic random walk after 570864 steps, saw 95395 distinct states, run finished after 3005 ms. (steps per millisecond=189 ) properties seen :0
// Phase 1: matrix 402 rows 451 cols
[2024-06-01 00:12:22] [INFO ] Computed 62 invariants in 18 ms
[2024-06-01 00:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 91/235 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 209/444 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3/447 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 402/849 variables, 447/509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 4/853 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/853 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 514 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6301 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 451/451 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 91/235 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:12:29] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:12:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:12:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 209/444 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 3/447 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 402/849 variables, 447/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:12:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:12:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:12:37] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/853 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/853 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:13:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:13:07] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:13:07] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:13:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:13:07] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/853 variables, 9/539 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 539 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 451/451 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 15/15 constraints]
After SMT, in 51507ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 144 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 402/402 transitions.
Applied a total of 0 rules in 22 ms. Remains 451 /451 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 451/451 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 402/402 transitions.
Applied a total of 0 rules in 13 ms. Remains 451 /451 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 00:13:13] [INFO ] Invariant cache hit.
[2024-06-01 00:13:14] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 00:13:14] [INFO ] Invariant cache hit.
[2024-06-01 00:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:13:14] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2024-06-01 00:13:14] [INFO ] Redundant transitions in 23 ms returned []
Running 401 sub problems to find dead transitions.
[2024-06-01 00:13:14] [INFO ] Invariant cache hit.
[2024-06-01 00:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/853 variables, 451/513 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/853 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:13:23] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:13:24] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 8/522 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 853/853 variables, and 522 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 451/451 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/451 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:13:48] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:13:49] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:13:50] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:13:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 19/109 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:13:54] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:13:54] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:14:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:14:03] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:14:03] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:14:03] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:14:03] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:14:03] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/853 variables, and 125 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/451 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/401 constraints, Known Traps: 63/63 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61353 ms. Remains : 451/451 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 451 /451 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-06-01 00:14:15] [INFO ] Invariant cache hit.
[2024-06-01 00:14:15] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-06-01 00:14:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 43 ms returned sat
[2024-06-01 00:14:15] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 00:14:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-06-01 00:14:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 39 ms returned sat
[2024-06-01 00:14:17] [INFO ] After 1712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 00:14:17] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 00:14:17] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:14:18] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:14:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2024-06-01 00:14:18] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:14:18] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:14:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2024-06-01 00:14:19] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 00:14:19] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-06-01 00:14:20] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:14:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 561 ms
[2024-06-01 00:14:20] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 00:14:20] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 00:14:20] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:14:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 439 ms
TRAPS : Iteration 1
[2024-06-01 00:14:23] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:14:23] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:14:23] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:14:23] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:14:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 458 ms
[2024-06-01 00:14:24] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-06-01 00:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-06-01 00:14:24] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-06-01 00:14:25] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
TRAPS : Iteration 2
[2024-06-01 00:14:27] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-01 00:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
TRAPS : Iteration 3
[2024-06-01 00:14:30] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:14:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:14:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:14:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 188 ms
TRAPS : Iteration 4
[2024-06-01 00:14:33] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-01 00:14:33] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:14:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:14:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
TRAPS : Iteration 5
[2024-06-01 00:14:35] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 00:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
TRAPS : Iteration 6
[2024-06-01 00:14:39] [INFO ] After 23943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 00:14:42] [INFO ] After 26647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 26963 ms.
[2024-06-01 00:14:42] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 00:14:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 451 places, 402 transitions and 1562 arcs took 8 ms.
[2024-06-01 00:14:42] [INFO ] Flatten gal took : 65 ms
Total runtime 156327 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 : DES-PT-60b-ReachabilityFireability-2024-00
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-01
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-04
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-05
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-06
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-08
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-10
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-11
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-13
Could not compute solution for formula : DES-PT-60b-ReachabilityFireability-2024-15
BK_STOP 1717200882920
--------------------
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 DES-PT-60b-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/906/inv_0_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/906/inv_1_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/906/inv_2_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/906/inv_3_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/906/inv_4_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/906/inv_5_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/906/inv_6_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/906/inv_7_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/906/inv_8_
rfs formula name DES-PT-60b-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/906/inv_9_
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="DES-PT-60b"
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 DES-PT-60b, 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 r480-tall-171624189900759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 ;