About the Execution of LTSMin+red for PolyORBLF-COL-S02J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9078.787 | 122868.00 | 189858.00 | 70.70 | TTFTFTTFTFFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446300087.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J04T08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300087
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717248260185
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:24:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:24:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:24:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:24:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2024-06-01 13:24:22] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:24:22] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-06-01 13:24:22] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 294 steps (0 resets) in 18 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 13:24:22] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:24:22] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:24:22] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 33 ms.
[2024-06-01 13:24:22] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-06-01 13:24:22] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 13:24:22] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (11 resets) in 2986 ms. (13 steps per ms) remains 9/16 properties
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (13 resets) in 1679 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 911 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 1798 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 1967 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1128 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 2258 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 2097 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 814 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (9 resets) in 728 ms. (54 steps per ms) remains 9/9 properties
[2024-06-01 13:24:27] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-06-01 13:24:27] [INFO ] Computed 50 invariants in 51 ms
[2024-06-01 13:24:27] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-03 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 29/41 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/41 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/610 variables, 2/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/614 variables, 7/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1098/1712 variables, 614/664 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1712 variables, 96/760 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1712 variables, 0/760 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1712/1712 variables, and 760 constraints, problems are : Problem set: 8 solved, 1 unsolved in 3689 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 614/614 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 147/213 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/504 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/515 variables, 3/9 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/608 variables, 36/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 30 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 5/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/612 variables, 4/54 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1710/1712 variables, and 666 constraints, problems are : Problem set: 8 solved, 1 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 612/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 12147ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 66 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 612 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 122 place count 556 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 548 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 548 transition count 986
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 484 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 370 place count 428 transition count 930
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 386 place count 428 transition count 914
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 402 place count 412 transition count 914
Applied a total of 402 rules in 294 ms. Remains 412 /614 variables (removed 202) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2024-06-01 13:24:39] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-06-01 13:24:40] [INFO ] Computed 48 invariants in 28 ms
[2024-06-01 13:24:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:24:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 177 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:24:49] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:24:55] [INFO ] Deduced a trap composed of 152 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:24:55] [INFO ] Deduced a trap composed of 139 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 60 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 13:25:06] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-06-01 13:25:08] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 13:25:20] [INFO ] Deduced a trap composed of 87 places in 248 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 65 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 19/19 constraints]
After SMT, in 41926ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 41943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42261 ms. Remains : 412/614 places, 914/1114 transitions.
RANDOM walk for 40000 steps (15 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (19 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290037 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290037 steps, saw 167791 distinct states, run finished after 3008 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 13:25:25] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
[2024-06-01 13:25:25] [INFO ] Invariant cache hit.
[2024-06-01 13:25:25] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/322 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/324 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/408 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/410 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 898/1308 variables, 410/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1308 variables, 96/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1308 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1310 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1310 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1310 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1310 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1310/1310 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 412/412 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/183 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/322 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/324 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 84/408 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/410 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 898/1308 variables, 410/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1308 variables, 96/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1308 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1308 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1310 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1310 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1310 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1310 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1310/1310 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2775 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 412/412 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 66 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 914/914 transitions.
Applied a total of 0 rules in 26 ms. Remains 412 /412 variables (removed 0) and now considering 914/914 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 412/412 places, 914/914 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 914/914 transitions.
Applied a total of 0 rules in 27 ms. Remains 412 /412 variables (removed 0) and now considering 914/914 (removed 0) transitions.
[2024-06-01 13:25:29] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
[2024-06-01 13:25:29] [INFO ] Invariant cache hit.
[2024-06-01 13:25:29] [INFO ] Implicit Places using invariants in 406 ms returned [366, 367, 368, 369, 370, 371, 372, 373]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 413 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 404/412 places, 914/914 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 396 transition count 906
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 396 transition count 906
Applied a total of 16 rules in 36 ms. Remains 396 /404 variables (removed 8) and now considering 906/914 (removed 8) transitions.
[2024-06-01 13:25:29] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
// Phase 1: matrix 890 rows 396 cols
[2024-06-01 13:25:29] [INFO ] Computed 40 invariants in 23 ms
[2024-06-01 13:25:29] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 13:25:29] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-06-01 13:25:29] [INFO ] Invariant cache hit.
[2024-06-01 13:25:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:25:34] [INFO ] Implicit Places using invariants and state equation in 4504 ms returned []
Implicit Place search using SMT with State Equation took 4802 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 396/412 places, 906/914 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5279 ms. Remains : 396/412 places, 906/914 transitions.
RANDOM walk for 40000 steps (17 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361503 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361503 steps, saw 192156 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-06-01 13:25:37] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-06-01 13:25:37] [INFO ] Invariant cache hit.
[2024-06-01 13:25:37] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/314 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/394 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 890/1284 variables, 394/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 96/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1284 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1286 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1286 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1286 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1286/1286 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 396/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/314 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/394 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 5 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:25:39] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 890/1284 variables, 394/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1284 variables, 96/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1284 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1284 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1286 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1286 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1286/1286 variables, and 539 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 396/396 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5689ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 267 ms.
Support contains 66 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 906/906 transitions.
Applied a total of 0 rules in 20 ms. Remains 396 /396 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 396/396 places, 906/906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 906/906 transitions.
Applied a total of 0 rules in 22 ms. Remains 396 /396 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2024-06-01 13:25:43] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-06-01 13:25:43] [INFO ] Invariant cache hit.
[2024-06-01 13:25:43] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 13:25:43] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-06-01 13:25:43] [INFO ] Invariant cache hit.
[2024-06-01 13:25:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:25:47] [INFO ] Implicit Places using invariants and state equation in 4085 ms returned []
Implicit Place search using SMT with State Equation took 4405 ms to find 0 implicit places.
[2024-06-01 13:25:48] [INFO ] Redundant transitions in 56 ms returned []
Running 904 sub problems to find dead transitions.
[2024-06-01 13:25:48] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-06-01 13:25:48] [INFO ] Invariant cache hit.
[2024-06-01 13:25:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 147 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 140 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/396 variables, 2/56 constraints. Problems are: Problem set: 88 solved, 816 unsolved
[2024-06-01 13:26:15] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:26:18] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 5 ms to minimize.
[2024-06-01 13:26:18] [INFO ] Deduced a trap composed of 134 places in 216 ms of which 6 ms to minimize.
[2024-06-01 13:26:19] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
SMT process timed out in 31342ms, After SMT, problems are : Problem set: 88 solved, 816 unsolved
Search for dead transitions found 88 dead transitions in 31351ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 396/396 places, 818/906 transitions.
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 395 transition count 802
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 17 place count 379 transition count 786
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 17 rules in 20 ms. Remains 379 /396 variables (removed 17) and now considering 786/818 (removed 32) transitions.
[2024-06-01 13:26:19] [INFO ] Flow matrix only has 770 transitions (discarded 16 similar events)
// Phase 1: matrix 770 rows 379 cols
[2024-06-01 13:26:19] [INFO ] Computed 41 invariants in 33 ms
[2024-06-01 13:26:19] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-06-01 13:26:19] [INFO ] Flow matrix only has 770 transitions (discarded 16 similar events)
[2024-06-01 13:26:19] [INFO ] Invariant cache hit.
[2024-06-01 13:26:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 13:26:22] [INFO ] Implicit Places using invariants and state equation in 3212 ms returned []
Implicit Place search using SMT with State Equation took 3543 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/396 places, 786/906 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39410 ms. Remains : 379/396 places, 786/906 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T08-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 121538 ms.
ITS solved all properties within timeout
BK_STOP 1717248383053
--------------------
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
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="PolyORBLF-COL-S02J04T08"
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 PolyORBLF-COL-S02J04T08, 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 r516-tajo-171654446300087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 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 ;